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

The bitmapped radix tree associative array deploys a hybrid node selection method, one using binary search for small node lists and bit counting (in a bitmap) for larger lists. It otherwise preserves the characteristics of the relaxed radix tree associative array.

It is supposed to trade space for performance, in a limited fashion.

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

General library:

See String Key Pointer Value Array Library.