---

4.1.3.1 Critical Bit Tree Associative Array

The critical bit tree associative array selects nodes with 1 bit. The tree is path compressed, it is not prefix compressed.

The tree is a binary tree, storing information in leaves only. All internal nodes have two children. For N items there exist N leaf nodes and N - 1 internal nodes.

General library:

See String Key Pointer Value Array Library.

• The bind data insertion routine:

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

• The case data structure state retriever:

  int x1f4_case_s4deck(void *);
  

• The fast associative array constructor routine:

  int x1f4_fast_s4deck(void *, unsigned, struct x1f4_s4deck_type *);
  

• The find plain search routine:

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

• The fini associative array regular destructor routine:

  int x1f4_fini_s4deck(void **);
  

• The flat associative array destructor routine:

  int x1f4_flat_s4deck(void *);
  

• The init associative array regular constructor routine:

  int x1f4_init_s4deck(void **, unsigned, struct x1f4_s4deck_type *);
  

• The lime data traversal routine:

  int x1f4_lime_s4deck(void *, void *, int (*)(void *, void *));
  

• The note data traversal routine:

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

• The pass plain data deletion routine:

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

• The pick plain search routine:

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

• The post plain data insertion routine:

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

• The scan supporting tree visiting routine:

  int x1f4_scan_s4deck
      (void *, void *, int (*)(void *, const void *, unsigned));