The bitmapped lookup radix tree associative organizes nodes in fixed length blocks. The blocks are accessed internally as lookup tables. A node bitmap describes the allocated blocks. It otherwise preserves the characteristics of the inlined radix tree associative array.
Over the design it aims to improve, the approach requires significantly higher space for dubious time gains.
The trie cannot store binary keys (strings containing null characters).
See String Key Pointer Value Array Library.
fastassociative array constructor routine:
extern int x1f4_fast_skdeck(void *, unsigned, struct x1f4_sxdeck_type *);
findplain search routine:
extern int x1f4_find_skdeck(void *, const char *, const void **);
finiassociative array regular destructor routine:
extern int x1f4_fini_skdeck(void **);
flatassociative array destructor routine:
extern int x1f4_flat_skdeck(void *);
initassociative array regular constructor routine:
extern int x1f4_init_skdeck(void **, unsigned, struct x1f4_sxdeck_type *);
listdata traversal routine:
extern int x1f4_list_skdeck (void *, void *, int (*) (void *, const char *, unsigned), char *);
postplain data insertion routine:
extern int x1f4_post_skdeck(void *, const char *, const void *);