6 releases

0.1.5 Dec 22, 2024
0.1.4 Jul 21, 2020
0.1.3 Jun 7, 2018
0.1.2 Feb 24, 2018
0.1.0 Oct 25, 2017

#25 in Data structures

Download history 92716/week @ 2025-01-03 121390/week @ 2025-01-10 118808/week @ 2025-01-17 123064/week @ 2025-01-24 135217/week @ 2025-01-31 155816/week @ 2025-02-07 152817/week @ 2025-02-14 149516/week @ 2025-02-21 151760/week @ 2025-02-28 147440/week @ 2025-03-07 169814/week @ 2025-03-14 149450/week @ 2025-03-21 142859/week @ 2025-03-28 168329/week @ 2025-04-04 143827/week @ 2025-04-11 137908/week @ 2025-04-18

617,235 downloads per month
Used in 407 crates (40 directly)

Apache-2.0

59KB
997 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

~205KB