- 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.
推薦閱讀
- 我們都是數據控:用大數據改變商業(yè)、生活和思維方式
- 數據庫技術與應用教程(Access)
- 從零開始學Hadoop大數據分析(視頻教學版)
- Developing Mobile Games with Moai SDK
- 計算機信息技術基礎實驗與習題
- PySpark大數據分析與應用
- 云計算服務保障體系
- WS-BPEL 2.0 Beginner's Guide
- Spark大數據分析實戰(zhàn)
- Python金融實戰(zhàn)
- 大數據技術入門
- Python數據分析與數據化運營
- Visual Studio 2013 and .NET 4.5 Expert Cookbook
- 大數據技術原理與應用:概念、存儲、處理、分析與應用
- Arquillian Testing Guide