extended-collections contains various implementations of collections that are not found in the standard library.
Add this to your
[dependencies] extended-collections = "*"
and this to your crate root:
extern crate extended_collections;
Blelloch, Guy E., and Margaret Reid-Miller. 1998. “Fast Set Operations Using Treaps.” In Proceedings of the Tenth Annual Acm Symposium on Parallel Algorithms and Architectures, 16–26. SPAA ’98. New York, NY, USA: ACM. doi:10.1145/277651.277660.
Pugh, William. 1990a. “A Skip List Cookbook.” College Park, MD, USA: University of Maryland at College Park.
Pugh, William. 1990b. “Skip Lists: A Probabilistic Alternative to Balanced Trees.” Commun. ACM 33 (6). New York, NY, USA: ACM: 668–76. doi:10.1145/78973.78977.
Fast, but limited allocator.
Self-balancing binary search tree where the heights of the two child subtrees of any node differ by at most one.
Disk-resident N-ary tree.
Hybrid tree comprised of disk-resident sorted runs of data and memory-resident tree.
Self-balancing binary search tree that uses a color bit to ensure that the tree remains approximately balanced during insertions and deletions.
Probabilistic linked hierarchy of subsequences.
Self-adjusting binary search tree with the additional property that recently accessed elements are quick to access again.
Lock-free data structures.
Probabilistic binary search tree where each node also maintains the heap invariant.