---

4.1.2.4 Lookup Radix Tree Associative Array

The lookup radix tree associative array deploys a hybrid node selection method, one using binary search for sparse node lists and look up tables for dense lists. It otherwise preserves the characteristics of the inlined radix tree associative array.

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

General library:

See String Key Pointer Value Array Library.

• The case data structure state retriever:

  int x1f4_case_sldeck(void *);
  

• The cast plain data deletion routine:

  int x1f4_cast_sldeck(void *, const char *);
  

• The fast associative array constructor routine:

  int x1f4_fast_sldeck(void *, unsigned, struct x1f4_sldeck_type *);
  

• The find plain search routine:

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

• The fini associative array regular destructor routine:

  int x1f4_fini_sldeck(void **);
  

• The flat associative array destructor routine:

  int x1f4_flat_sldeck(void *);
  

• The init associative array regular constructor routine:

  int x1f4_init_sldeck(void **, unsigned, struct x1f4_sldeck_type *);
  

• The lime data traversal routine:

  int x1f4_lime_sldeck(void *, void *, int (*)(void *, void *));
  

• The list data traversal routine:

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

• The pass plain data deletion routine:

  int x1f4_pass_sldeck(void *, const char *);
  

• The post plain data insertion routine:

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