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


4.1.2.3 Inlined Radix Tree Associative Array

The inlined radix tree associative array stores the short enough path segments in the place of the path segment pointers. It otherwise preserves the characteristics of the relaxed radix tree associative array.

It is slightly faster and more memory conservative over the design it improves.

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

General library:

See String Key Pointer Value Array Library.

See String Key Pointer Value Array Search Library.


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