Keyboard shortcuts

Press ← or β†’ to navigate between chapters

Press S or / to search in the book

Press ? to show this help

Press Esc to hide this help

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

Triekeyiterationsubtractive set ops
Amtimpl InlineTODO: sorted
HamtHashN/Aβœ“
Trieimpl ReflessObjectsorted

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
  • append but leaves old items in other
  • IPLD storage
  • encrypted IPLD storage
  • Ipld
  • #[derive(ByteOrd)]
  • #[derive(CanonicalExtra)]
  • {Hamt,Trie}{Map,Set}: FromIterator
  • auto-inlining wrapper
  • generic Trie algorithms
  • type as value
  • Option instead of bool for Apply on sets
  • subtries
    • Amt
    • Trie
  • array FromSized
  • AsyncSeek side-fetching for chunks