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 orderedhashmap::OrderedHashMap;

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