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"

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")));