Crate collectionsExperimental[src]
Collection types.
Reexports
pub use bitv::{Bitv, BitvSet}; |
pub use btree::BTree; |
pub use dlist::DList; |
pub use enum_set::EnumSet; |
pub use priority_queue::PriorityQueue; |
pub use ringbuf::RingBuf; |
pub use smallintmap::SmallIntMap; |
pub use string::String; |
pub use treemap::{TreeMap, TreeSet}; |
pub use trie::{TrieMap, TrieSet}; |
pub use vec::Vec; |
Modules
| 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 |
| hash | Generic hashing support. |
| priority_queue | A priority queue implemented with a binary heap |
| ringbuf | A double-ended queue implemented as a circular buffer |
| slice | Utilities for vector manipulation |
| smallintmap | A simple map based on a vector for small integer keys. Space requirements are O(highest integer key). |
| str | Unicode string manipulation ( |
| string | An owned, growable string that enforces that its contents are valid UTF-8. |
| 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 ( |
| vec | An owned, growable vector. |
Traits
| 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. |