January 2019
Intermediate to advanced
316 pages
8h 8m
English
Content preview from Hands-On Data Structures and Algorithms with Rust
Become an O’Reilly member and get unlimited access to this title plus top books and audiobooks from O’Reilly and nearly 200 top publishers, thousands of courses curated by job role, 150+ live events each month,
Start your free trial
Downsides
Even though constant time retrieval sounds nice, the benchmarks show that it's not that simple. The downsides are as follows:
- Performance highly depends on the hash function and application
- Easy to implement naively, hard to get right
- Unordered storage
Some of these downsides could be mitigated by using a tree-based map, but that would be a tree as described in the previous chapter, and there is one data structure left to discuss here: the set.