---

4.1.2.3 Inlined Radix Tree Associative Array

The inlined radix tree associative array stores the short enough path segments in the place of the path segment pointers. It otherwise preserves the characteristics of the relaxed radix tree associative array.

It is slightly faster and more memory conservative over the design it improves.

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

General library:

See String Key Pointer Value Array Library.

See String Key Pointer Value Array Search Library.

• The case data structure state retriever:

  int x1f4_case_sfdeck(void *);
  

• The cast plain data deletion routine:

  int x1f4_cast_sfdeck(void *, const char *);
  

• The ever record retriever:

  int x1f4_ever_sfdeck(void *, const void **);
  

• The fast associative array constructor routine:

  int x1f4_fast_sfdeck(void *, unsigned, struct x1f4_sfdeck_type *);
  

• The fgvq first greater search routine:

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

• The fgxd first greater search routine:

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

• The find plain search routine:

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

• The fini associative array regular destructor routine:

  int x1f4_fini_sfdeck(void **);
  

• The flat associative array destructor routine:

  int x1f4_flat_sfdeck(void *);
  

• The fxxd first greater or matching search routine:

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

• The high data purge routine:

  int x1f4_high_sfdeck(void *);
  

• The init associative array regular constructor routine:

  int x1f4_init_sfdeck(void **, unsigned, struct x1f4_sfdeck_type *);
  

• The jack memory allocator definition retriever:

  int x1f4_jack_sfdeck(void *, void *);
  

• The lead record retriever:

  int x1f4_lead_sfdeck(void *, const void **);
  

• The lift first record retriever:

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

• The lime data traversal routine:

  int x1f4_lime_sfdeck(void *, void *, int (*)(void *, void *));
  

• The line data copy routine:

  int x1f4_line_sfdeck
      (void *, void *, int (*)(void *, const void **, const void *),
       int (*)(void *, const void *), void *);
  

• The list data traversal routine:

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

• The llvq last less search routine:

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

• The llxd last less search routine:

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

• The lxxd last less or matching search routine:

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

• The mind data deletion routine:

  int x1f4_mind_sfdeck(void *);
  

• The pass plain data deletion routine:

  int x1f4_pass_sfdeck(void *, const char *);
  

• The plot last record retriever:

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

• The post plain data insertion routine:

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

• The rush supporting tree visiting routine:

  int x1f4_rush_sfdeck
      (void *, unsigned unused, void *,
       int (*)(void *, unsigned depth, unsigned fanout));
  

• The scan supporting tree visiting routine:

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

• The skew memory allocator replacer routine:

  int x1f4_skew_sfdeck(void *, void *);
  

• The slip data deletion routine:

  int x1f4_slip_sfdeck(void *);
  

• The text plain copy routine:

  int x1f4_text_sfdeck
      (void **, void *, int (*)(void *, const void **, const void *),
       int (*)(void *, const void *), void *);