20 releases

Uses old Rust 2015

0.5.3 May 6, 2020
0.5.2 Mar 21, 2019
0.5.1 Jan 29, 2018
0.5.0 Jul 26, 2017
0.0.2 Mar 26, 2015

#19 in Data structures

Download history 145728/week @ 2020-07-04 142654/week @ 2020-07-11 148106/week @ 2020-07-18 144524/week @ 2020-07-25 149970/week @ 2020-08-01 142001/week @ 2020-08-08 146580/week @ 2020-08-15 144253/week @ 2020-08-22 144058/week @ 2020-08-29 139424/week @ 2020-09-05 152390/week @ 2020-09-12 150972/week @ 2020-09-19 160362/week @ 2020-09-26 161946/week @ 2020-10-03 164954/week @ 2020-10-10 145379/week @ 2020-10-17

612,409 downloads per month
Used in 2,149 crates (111 directly)

MIT/Apache

46KB
936 lines

WARNING: THIS PROJECT IS IN MAINTENANCE MODE, DUE TO INSUFFICIENT MAINTAINER RESOURCES

It works fine, but will generally no longer be improved.

We are currently only accepting changes which:

  • keep this compiling with the latest versions of Rust or its dependencies.
  • have minimal review requirements, such as documentation changes (so not totally new APIs).

A HashMap wrapper that holds key-value pairs in insertion order.

Documentation is available at https://contain-rs.github.io/linked-hash-map/linked_hash_map.


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

Dependencies

~115KB