---

4.1.2.8 Compact Lookup Array Radix Tree Associative Array

The compact lookup array radix tree associative array organizes internal nodes in two sections, first of continuation characters (bytes), and the second of child pointers.

The approach aims to achieve a better (cache) locality for the continuation character search. It fails to significantly improve over the inlined radix tree associative array. If favors dense distributions, for which it does slightly better than the latter.

General library:

See String Key Pointer Value Array Library.

• The fast associative array constructor routine:

  int x1f4_fast_sadeck(void *, unsigned, struct x1f4_sadeck_type *);
  

• The find plain search routine:

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

• The fini associative array regular destructor routine:

  int x1f4_fini_sadeck(void **);
  

• The flat associative array destructor routine:

  int x1f4_flat_sadeck(void *);
  

• The init associative array regular constructor routine:

  int x1f4_init_sadeck(void **, unsigned, struct x1f4_sadeck_type *);
  

• The list data traversal routine:

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

• The post plain data insertion routine:

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