Module std::collections [src]

Collection types.

Reexports

pub use self::hashmap::{HashMap, HashSet};

pub use self::lru_cache::LruCache;

bitv
btree	Starting implementation of a btree for rust. Structure inspired by github user davidhalperin's gist.
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 (`HashSet` and `HashMap` types)
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 `Ord`.
trie	Ordered containers with integer keys, implemented as radix tries (`TrieSet` and `TrieMap` types)

BTree
Bitv	The bitvector type
BitvSet	An implementation of a set using a bit vector as an underlying representation for holding numerical elements.
DList	A doubly-linked list.
EnumSet	A specialized Set implementation to use enum types.
PriorityQueue	A priority queue implemented with a binary heap
RingBuf	RingBuf is a circular buffer that implements Deque.
SmallIntMap
TreeMap
TreeSet	A implementation of the `Set` trait on top of the `TreeMap` container. The only requirement is that the type of the elements contained ascribes to the `Ord` trait.
TrieMap
TrieSet

Collection	A trait to represent the abstract idea of a container. The only concrete knowledge known is the number of elements contained within.
Deque	A double-ended sequence that allows querying, insertion and deletion at both ends.
Map	A map is a key-value store where values may be looked up by their keys. This trait provides basic operations to operate on these stores.
Mutable	A trait to represent mutable containers
MutableMap	This trait provides basic operations to modify the contents of a map.
MutableSet	This trait represents actions which can be performed on sets to mutate them.
Set	A set is a group of objects which are each distinct from one another. This trait represents actions which can be performed on sets to iterate over them.