Next: , Up: B-tree String Key Variable Size Value Arrays   [Index] Critical Bit Tree Organized Nodes B-tree Associative Array

The B-tree associative array organizes its nodes as critical bit trees. Node traversals for most operations require two critical bit tree traversals and one string comparison.

A small number of bits around the critical bits are cached, allowing the second critical bit tree traversal and the string comparison to be skipped at times.

General library:

See String Key Variable Size Value Array Library.