5 releases

0.1.4 Jul 21, 2020
0.1.3 Jun 7, 2018
0.1.2 Feb 24, 2018
0.1.1 Dec 4, 2017
0.1.0 Oct 25, 2017

#66 in Data structures

Download history 112874/week @ 2023-11-21 130758/week @ 2023-11-28 115642/week @ 2023-12-05 106927/week @ 2023-12-12 103997/week @ 2023-12-19 43056/week @ 2023-12-26 98716/week @ 2024-01-02 106412/week @ 2024-01-09 113329/week @ 2024-01-16 113593/week @ 2024-01-23 107636/week @ 2024-01-30 114023/week @ 2024-02-06 107900/week @ 2024-02-13 114748/week @ 2024-02-20 112322/week @ 2024-02-27 70958/week @ 2024-03-05

425,695 downloads per month
Used in 298 crates (28 directly)

Apache-2.0

59KB
919 lines

linked_hash_set crates.io Documentation

This library provides an hashed set with predictable iteration order, based on the insertion order of elements. It is implemented as a linked_hash_map::LinkedHashMap where the value is (), in a similar way as HashSet is implemented from HashMap in stdlib.

Comparison with std HashSet

General usage is very similar to a traditional hashed set, but this structure also maintains insertion order.

Compared to HashSet, a LinkedHashSet uses an additional doubly-linked list running through its entries. As such methods front(), pop_front(), back(), pop_back() and refresh() are provided.

Comparison with IndexSet

Compared to indexmap::IndexSet, while both maintain insertion order a LinkedHashSet uses a linked list allowing performant removals that don't affect the order of the remaining elements. However, when this distinction is unimportant indexmap should be the faster option.

Example

let mut set = linked_hash_set::LinkedHashSet::new();
assert!(set.insert(234));
assert!(set.insert(123));
assert!(set.insert(345));
assert!(!set.insert(123)); // Also see `insert_if_absent` which won't change order

assert_eq!(set.into_iter().collect::<Vec<_>>(), vec![234, 345, 123]);

Minimum supported rust compiler

This crate is maintained with latest stable rust.

Dependencies

~235KB