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 |
Development process
I decided to document how I do the dev process, since itβs by now become core part of the project itself.
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)]#[derive(CanonicalExtra)]{Hamt,Trie}{Map,Set}: FromIterator- auto-inlining wrapper
- generic
Triealgorithms - type as value
Optioninstead ofboolforApplyon sets- subtries
AmtTrie
- array
FromSized AsyncSeekside-fetching for chunks