Next: , Previous: , Up: Trie String Key Pointer Value Arrays   [Index]


4.1.2.4 Lookup Radix Tree Associative Array

The lookup radix tree associative array deploys a hybrid node selection method, one using binary search for sparse node lists and look up tables for dense lists. It otherwise preserves the characteristics of the inlined radix tree associative array.

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

General library:

See String Key Pointer Value Array Library.


Next: , Previous: , Up: Trie String Key Pointer Value Arrays   [Index]