Tries we have
the main inspiration for recent implementations are ART and HAMT
all implementations presently use HAMT-style array maps
all require V: Inline
| Trie | key | iteration | subtractive set ops |
|---|---|---|---|
Amt | impl Inline | TODO: sorted | |
Hamt | Hash | N/A | ✓ |
Trie | impl ReflessObject | sorted |
planned for inclusion
Alisa Feistel maintains this list for herself, please do NOT treat this as an invitation for PRs.
NonZero<i*>niches- LEB128
appendbut leaves old items inother- IPLD storage
- encrypted IPLD storage
Ipld#[derive(ByteOrd)]{Hamt,Trie}{Map,Set}: FromIterator- auto-inlining wrapper
- generic
Triealgorithms - type as value
Optioninstead ofboolforApplyon sets, and add key toOptionon maps- subtries
AmtTrie