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


4.1.2.2 Relaxed Radix Tree Associative Array

The memory slack radix tree associative array uses a more aggresive memory management approach (it reallocates the tree node children lists in steps of 4 instead of 1). It otherwise preserves the characteristics of the previous radix tree associative array (8 bit node selection, path compression, prefix compression).

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.

See String Key Pointer Value Array Search Library.


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