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

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.

- The
`fast`

associative array constructor routine:extern int x1f4_fast_s8deck(void *, unsigned, struct x1f4_s8deck_type *);

- The
`find`

plain search routine:extern int x1f4_find_s8path(void *, const char *, unsigned, const void **);

- The
`fini`

associative array regular destructor routine:extern int x1f4_fini_s8deck(void **);

- The
`flat`

associative array destructor routine:extern int x1f4_flat_s8deck(void *);

- The
`init`

associative array regular constructor routine:extern int x1f4_init_s8deck(void **, unsigned, struct x1f4_s8deck_type *);

- The
`note`

data traversal routine:extern int x1f4_note_s8deck (void *, void *, int (*) (void *, const char *, unsigned));

- The
`pass`

plain data deletion routine:extern int x1f4_pass_s8path(void *, const char *, unsigned);

- The
`post`

plain data insertion routine:extern int x1f4_post_s8path(void *, const char *, unsigned, const void *);