---

4.1.2.6 Bitmapped Radix Tree Associative Array

The bitmapped radix tree associative array deploys a hybrid node selection method, one using binary search for small node lists and bit counting (in a bitmap) for larger lists. It otherwise preserves the characteristics of the inlined radix tree associative array.

It is supposed to trade space for performance, in a limited fashion.

The trie cannot store binary keys (strings containing null characters).

General library:

See String Key Pointer Value Array Library.

• The cast plain data deletion routine:

  int x1f4_cast_sjdeck(void *, const char *);
  

• The fast associative array constructor routine:

  int x1f4_fast_sjdeck(void *, unsigned, struct x1f4_sjdeck_type *);
  

• The find plain search routine:

  int x1f4_find_sjdeck(void *, const char *, const void **);
  

• The fini associative array regular destructor routine:

  int x1f4_fini_sjdeck(void **);
  

• The flat associative array destructor routine:

  int x1f4_flat_sjdeck(void *);
  

• The init associative array regular constructor routine:

  int x1f4_init_sjdeck(void **, unsigned, struct x1f4_sjdeck_type *);
  

• The list data traversal routine:

  int x1f4_list_sjdeck
      (void *, void *, int (*)(void *, const char *, unsigned), char *);
  

• The pass plain data deletion routine:

  int x1f4_pass_sjdeck(void *, const char *);
  

• The post plain data insertion routine:

  int x1f4_post_sjdeck(void *, const char *, const void *);