- Hands-On Data Structures and Algorithms with Rust
- Claus Matzinger
- 194字
- 2021-07-02 14:11:51
Lists, Lists, and More Lists
Lists are everywhere: shopping lists, to-do lists, recipes, street numbers in western countries... simply everywhere. Their defining characteristic, storing things in a linear, defined relationship with each other, helps us keep track of stuff and find it again later on. From a data structure perspective, they are also essential to almost any program and come in various shapes and forms. While some lists are tricky to implement in Rust, the general principles can be found here as well, along with some valuable lessons on the borrow checker! After this chapter, we want you to know more about the following:
- (Doubly) linked lists and when you should use them
- Array lists, better known as Rust's vector
- Skip lists and, ideally, the New York metro subway system
- Implementing a simple transaction log
As a final note, this chapter will build safe implementations of various lists, even though unsafe versions could be faster and require less code. This decision is due to the fact that, when working on regular use cases, unsafe is almost never a solution. Check out the links in the Further reading section of this chapter for unsafe lists.
推薦閱讀
- 同步:秩序如何從混沌中涌現
- Java Data Science Cookbook
- 文本數據挖掘:基于R語言
- 數據庫原理與設計(第2版)
- Python金融數據分析(原書第2版)
- 圖數據實戰:用圖思維和圖技術解決復雜問題
- PostgreSQL指南:內幕探索
- 科研統計思維與方法:SPSS實戰
- 大數據分析:數據倉庫項目實戰
- Unreal Engine Virtual Reality Quick Start Guide
- 數據庫應用系統技術
- 大數據測試技術:數據采集、分析與測試實踐(在線實驗+在線自測)
- Unity for Architectural Visualization
- 數據挖掘算法實踐與案例詳解
- 算力芯片:高性能CPU/GPU/NPU微架構分析