Previous: , Up: Critical Bit Tree String Key Pointer Value Arrays   [Index] Cached Critical Bit Tree Associative Array

The cached critical bit tree associative array stores a small number of bits adjacent to the critical bit with the tree nodes. The caching renders the final string comparison unnecessary when it continuously tiles the tree descending path.

The improvements over the plain critical bit tree associative array are dubious, and the data structure is designed more as a testbed for the caching technique which is of more general interest.

General library:

See String Key Pointer Value Array Library.