---

4.1.2.2 Relaxed Radix Tree Associative Array

The memory slack radix tree associative array uses a more aggresive memory management approach (it reallocates the tree node children lists in steps of 4 instead of 1). It otherwise preserves the characteristics of the previous radix tree associative array (8 bit node selection, path compression, prefix compression).

It is supposed to trade space for performance, in a limited fashion.

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 bind data insertion routine:

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

• The case data structure state retriever:

  int x1f4_case_scdeck(void *);
  

• The cast plain data deletion routine:

  int x1f4_cast_scdeck(void *, const char *);
  

• The ever record retriever:

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

• The fast associative array constructor routine:

  int x1f4_fast_scdeck(void *, unsigned, struct x1f4_scdeck_type *);
  

• The fgvq first greater search routine:

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

• The fgxd first greater search routine:

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

• The find plain search routine:

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

• The fini associative array regular destructor routine:

  int x1f4_fini_scdeck(void **);
  

• The flat associative array destructor routine:

  int x1f4_flat_scdeck(void *);
  

• The high data purge routine:

  int x1f4_high_scdeck(void *);
  

• The init associative array regular constructor routine:

  int x1f4_init_scdeck(void **, unsigned, struct x1f4_scdeck_type *);
  

• The jack memory allocator definition retriever:

  int x1f4_jack_scdeck(void *, void *);
  

• The lead record retriever:

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

• The lift first record retriever:

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

• The lime data traversal routine:

  int x1f4_lime_scdeck(void *, void *, int (*)(void *, void *));
  

• The line data copy routine:

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

• The list data traversal routine:

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

• The llvq last less search routine:

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

• The llxd last less search routine:

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

• The mind data deletion routine:

  int x1f4_mind_scdeck(void *);
  

• The pass plain data deletion routine:

  int x1f4_pass_scdeck(void *, const char *);
  

• The pick plain search routine:

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

• The plot last record retriever:

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

• The post plain data insertion routine:

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

• The post plain data insertion routine:

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

• The rush supporting tree visiting routine:

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

• The scan supporting tree visiting routine:

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

• The skew memory allocator replacer routine:

  int x1f4_skew_scdeck(void *, void *);
  

• The slip data deletion routine:

  int x1f4_slip_scdeck(void *);
  

• The text plain copy routine:

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