HashTrie

HashTrie currently provides containers based on Hash Array Mapped Tries (HAMT). They are concurrency and functional programming friendly. While the data structures are immutable, the vast majority of memory is shared between instances as they are modified.

HashTrieSet implements a hash set. Here's a quick usage example. ``` use hashtrie::HashTrieSet; use std::{borrow::Cow, collections::hashmap::DefaultHasher};

let mut hashset: HashTrieSet = HashTrieSet::new(); let helloworld: String = "Hello, world!".into();

hashset = hashset.insert(Cow::Borrowed(&helloworld)).unwrap(); asserteq!(*hashset.insert(Cow::Borrowed(&helloworld)).unwraperr(), helloworld);

asserteq!(*hashset.find(&helloworld).unwrap(), helloworld);

match hashset.remove(&helloworld) { Ok((mutated, reference)) => { println!("Value stored in hashset: {}", reference); hashset = mutated; }, Err(_) => panic!(), } ```