---

4.2.2.2 Critical Bit Tree Organized Nodes B+ Tree Associative Array

The B+ tree associative array organizes its nodes as critical bit trees, much like the b-tree associative array that it inherits and of which characteristics it maintains.

See Critical Bit Tree Organized Nodes B-tree Associative Array.

General library:

See String Key Variable Size Value Array Library.

• The cast plain data deletion routine:

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

• The fast associative array constructor routine:

  int x1f4_fast_lznote(void *, unsigned, struct x1f4_lznote_type *);
  

• The find plain search routine:

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

• The fini associative array regular destructor routine:

  int x1f4_fini_lznote(void **);
  

• The flat associative array destructor routine:

  int x1f4_flat_lznote(void *);
  

• The flow data structure integrity check routine:

  int x1f4_flow_lznote(void *);
  

• The init associative array regular constructor routine:

  int x1f4_init_lznote(void **, unsigned, struct x1f4_lznote_type *);
  

• The note data traversal routine:

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

• The post plain data insertion routine:

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

• The span data traversal routine:

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