Crate collectionsExperimental[stability] [-]  [+] [src]

Collection types.

See std::collections for a detailed discussion of collections in Rust.

Reexports

pub use binary_heap::BinaryHeap;
pub use dlist::DList;
pub use enum_set::EnumSet;
pub use ring_buf::RingBuf;
pub use string::String;
pub use vec::Vec;
pub use vec_map::VecMap;

Modules

binary_heap

A priority queue implemented with a binary heap.

bitv
bitv_set
btree_map
btree_set
dlist

A doubly-linked list with owned nodes.

enum_set

A structure for holding a set of enum variants.

hash

Generic hashing support.

ring_buf

This crate implements a double-ended queue with O(1) amortized inserts and removals from both ends of the container. It also has O(1) indexing like a vector. The contained elements are not required to be copyable, and the queue will be sendable if the contained type is sendable. Its interface Deque is defined in collections.

slice

Utilities for slice manipulation

str

Unicode string manipulation (str type)

string

An owned, growable string that enforces that its contents are valid UTF-8.

tree_map
tree_set
trie_map
trie_set
vec

A growable list type, written Vec<T> but pronounced 'vector.'

vec_map

A simple map based on a vector for small integer keys. Space requirements are O(highest integer key).

Structs

BTreeMap

A map based on a B-Tree.

BTreeSet

A set based on a B-Tree.

Bitv

The bitvector type.

BitvSet

An implementation of a set using a bit vector as an underlying representation for holding unsigned numerical elements.

TreeMap

This is implemented as an AA tree, which is a simplified variation of a red-black tree where red (horizontal) nodes can only be added as a right child. The time complexity is the same, and re-balancing operations are more frequent but also cheaper.

TreeSet

An 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

A map implemented as a radix trie.

TrieSet

A set implemented as a radix trie.