[−][src]Crate ordermap
OrderMap is a hash table where the iteration order of the key-value
pairs is independent of the hash values of the keys.
Re-exports
pub use set::OrderSet; |
Modules
| set | A hash set implemented using |
Macros
| ordermap | Create an |
| orderset | Create an |
Structs
| Drain | |
| IntoIter | |
| Iter | |
| IterMut | |
| Keys | |
| OccupiedEntry | |
| OrderMap | A hash table where the iteration order of the key-value pairs is independent of the hash values of the keys. |
| VacantEntry | |
| Values | |
| ValuesMut |
Enums
| Entry | Entry for an existing key-value pair or a vacant location to insert one. |
Traits
| Equivalent | Key equivalence trait. |
| MutableKeys | Opt-in mutable access to keys. |