---

4.1.3.2 Pointer Critical Bit Tree Associative Array

The pointer critical bit tree associative array stores pointers to string keys (instead of string keys), i.e. it does not save the string keys and instead it is only recording pointers to them. It is otherwise same as the previous critical bit tree associative array.

See Critical Bit Tree Associative Array.

General library:

See String Key Pointer Value Array Library.

• The case data structure state retriever:

  int x1f4_case_s5deck(void *);
  

• The copy plain copy routine:

  int x1f4_copy_s5deck(void **, void *);
  

• The fast associative array constructor routine:

  int x1f4_fast_s5deck(void *, unsigned, struct x1f4_s5deck_type *);
  

• The fill data copy routine:

  int x1f4_fill_s5deck(void *, void *);
  

• The find plain search routine:

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

• The fini associative array regular destructor routine:

  int x1f4_fini_s5deck(void **);
  

• The flat associative array destructor routine:

  int x1f4_flat_s5deck(void *);
  

• The init associative array regular constructor routine:

  int x1f4_init_s5deck(void **, unsigned, struct x1f4_s5deck_type *);
  

• The lime data traversal routine:

  int x1f4_lime_s5deck(void *, void *, int (*)(void *, void *));
  

• The note data traversal routine:

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

• The pass plain data deletion routine:

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

• The pick plain search routine:

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

• The post plain data insertion routine:

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

• The span data traversal routine:

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