contiguous.md

CurrentModule = PureFun
DocSetup = quote using PureFun end

PureFun.Contiguous for small size optimizations

PureFun.Contiguous

Chunks: densely packed lists

PureFun.Contiguous.StaticChunk
PureFun.Contiguous.VectorChunk

Bits: a set requiring one integer worth of storage

PureFun.Contiguous.Bits

bitmap: a small dictionary

PureFun.Contiguous.bitmap

biterate: bit-wise iteration over single integers

Contiguous.bitmap is great if you only need a dictionary with small integer keys, but doesn't generalize to other use-cases. Contiguous.biterate takes arbitrary integers and breaks them into smaller integers suitable to be keys in a bitmap. PureFun.Tries.@trie allows you to chain together simpler dictionaries to build more general ones, so biterate, bitmap, and @trie combine to build very efficient BitMapped tries, as described in Fast and Space Efficient Trie Searches and Ideal Hash Trees

PureFun.Contiguous.biterate