KO
|
EN
gitlite — search
Search
#javascript
#python
#typescript
#nodejs
#windows
#react
#reactjs
#css
#minecraft
#android
#docker
#python3
linked-hash-set
★ 42
Open GitHub ↗
Rust HashSet with insertion ordering
Download README (.md)
Explore Similar Repositories
fsharp-hashcollections
:
Library providing fast hash based immutable map and set
BetterDictionary
:
Better performance generic Dictionary and HashSet optimized for Unity
redis-json
:
A wrapper library to store JSON Objects in redis-hashsets and retrieve it back as JSON objects
ritelinked
:
RiteLinked - LinkedHashMap & LinkedHashSet in Rust
shoki
:
Purely functional data structures in Java
// repository documentation
Was this content helpful?
★ 0
(0 ratings)
Select Rating:
★
★
★
★
★
Submit Feedback
Recent Feedback
×
Download README
Do you want to download the
README.md
file for
linked-hash-set
?
Download (.md)
linked\_hash\_set [](https://crates.io/crates/linked_hash_set) [](https://docs.rs/linked_hash_set) ================= 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`](https://github.com/contain-rs/linked-hash-map) where the value is `()`, in a similar way as `HashSet` is implemented from `HashMap` in stdlib. ## Comparison with std [`HashSet`](https://doc.rust-lang.org/std/collections/struct.HashSet.html) 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`](https://github.com/bluss/indexmap) 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 ```rust 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](https://gist.github.com/alexheretic/d1e98d8433b602e57f5d0a9637927e0c).
