---

4.2.2.1 Critical Bit Tree Organized Nodes B-tree Associative Array

The B-tree associative array organizes its nodes as critical bit trees. Node traversals for most operations require two critical bit tree traversals and one string comparison.

A small number of bits around the critical bits are cached, allowing the second critical bit tree traversal and the string comparison to be skipped at times.

General library:

See String Key Variable Size Value Array Library.

• The fast associative array constructor routine:

  int x1f4_fast_lsnote(void *, unsigned, struct x1f4_lsnote_type *);
  

• The find plain search routine:

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

• The fini associative array regular destructor routine:

  int x1f4_fini_lsnote(void **);
  

• The flat associative array destructor routine:

  int x1f4_flat_lsnote(void *);
  

• The init associative array regular constructor routine:

  int x1f4_init_lsnote(void **, unsigned, struct x1f4_lsnote_type *);
  

• The note data traversal routine:

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

• The post plain data insertion routine:

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

• The span data traversal routine:

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