Crate collections
Collection types.
Reexports
pub use bitv::Bitv; |
pub use btree::BTree; |
pub use deque::Deque; |
pub use dlist::DList; |
pub use enum_set::EnumSet; |
pub use hashmap::{HashMap, HashSet}; |
pub use lru_cache::LruCache; |
pub use priority_queue::PriorityQueue; |
pub use ringbuf::RingBuf; |
pub use smallintmap::SmallIntMap; |
pub use treemap::{TreeMap, TreeSet}; |
pub use trie::{TrieMap, TrieSet}; |
Modules
| bitv | |
| btree | Starting implementation of a btree for rust. Structure inspired by github user davidhalperin's gist. |
| deque | Container traits for collections |
| dlist | A doubly-linked list with owned nodes. |
| enum_set | A structure for holding a set of enum variants |
| hashmap | Unordered containers, implemented as hash-tables ( |
| lru_cache | A cache that holds a limited number of key-value pairs. When the capacity of the cache is exceeded, the least-recently-used (where "used" means a look-up or putting the pair into the cache) pair is automatically removed. |
| priority_queue | A priority queue implemented with a binary heap |
| ringbuf | A double-ended queue implemented as a circular buffer |
| smallintmap | A simple map based on a vector for small integer keys. Space requirements are O(highest integer key). |
| treemap | An ordered map and set implemented as self-balancing binary search
trees. The only requirement for the types is that the key implements
|
| trie | Ordered containers with integer keys, implemented as radix tries ( |