| heapsize.rs |
|
1260 |
| lib.rs |
A `HashMap` wrapper that holds key-value pairs in insertion order.
# Examples
```
use linked_hash_map::LinkedHashMap;
let mut map = LinkedHashMap::new();
map.insert(2, 20);
map.insert(1, 10);
map.insert(3, 30);
assert_eq!(map[&1], 10);
assert_eq!(map[&2], 20);
assert_eq!(map[&3], 30);
let items: Vec<(i32, i32)> = map.iter().map(|t| (*t.0, *t.1)).collect();
assert_eq!(items, [(2, 20), (1, 10), (3, 30)]);
``` |
44742 |
| serde.rs |
An optional implementation of serialization/deserialization. |
2460 |