Up: Trie String Key Variable Size Value Arrays   [Index]


4.2.3.1 Inlined Radix Tree Variable Size Value Associative Array

The associative array is constructed over a path compressed trie. The trie is a character (byte) one, i.e. node selection uses 8 bits. Nodes having a common parent are stored as a sorted array - node selection is binary search derived. The trie is prefix compressed - common prefixes are stripped from path internal vertexes. When short enough, the internal vertexes are stored in place of the pointers that would otherwise point to them.

The associative array is similar to one of the pointer value ones, save that the keys are stored in full and the value is of variable size.

See Inlined Radix Tree Associative Array.

General library:

See String Key Variable Size Value Array Library.

See String Key Variable Size Value Array Search Library.


Up: Trie String Key Variable Size Value Arrays   [Index]