ordered_hash_map 0.1.0

HashMap which preserves insertion order
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22

# OrderedHashMap

A HashMap which preserves insertion order.

This crate provides a no\_std implementation of a Linked Hash Map using as little unsafe as possible.

## Features
`serde` - Enable serde Serialization and Deserialization

## Usage
```
[dependencies]
linkedhashmap = "^0.1"
```

```rust
use ordered_hash_map::OrderedHashMap;

let mut map: OrderedHashMap<_, _> = [(1, "one"), (2, "two")].into_iter().collect();
map.insert(3, "three");
assert_eq!(map.iter().next(), Some((&1, &"one")));
```