Previous: , Up: Trie String Key Pointer Value Arrays   [Index] Bitmapped Lookup Radix Tree Associative Array

The bitmapped lookup radix tree associative organizes nodes in fixed length blocks. The blocks are accessed internally as lookup tables. A node bitmap describes the allocated blocks. It otherwise preserves the characteristics of the inlined radix tree associative array.

Over the design it aims to improve, the approach requires significantly higher space for dubious time gains.

The trie cannot store binary keys (strings containing null characters).

General library:

See String Key Pointer Value Array Library.