---

4.3.2.1 Adaptative Fixed Length Radix Tree Associative Array

The fixed length adaptative radix tree associative array is derived from the (variable length) adaptative radix tree associative array. It thus switches the tree node coding between the coding of the (variable length) compact lookup array radix tree associative array, the lookup radix tree associative array, the bitmapped radix tree associative array, the multibyte radix tree associative array and the front coded radix tree associative array.

See Adaptative Radix Tree Associative Array.

Over the variable length adaptative radix tree associative array, the fixed length associative array offers virtually no improvement in time and only minor improvements in space.

General library:

See Fixed Length String Key Pointer Value Array Library.

• The fast associative array constructor routine:

  int x1f4_fast_rideck(void *, unsigned, struct x1f4_rideck_type *);
  

• The fini associative array regular destructor routine:

  int x1f4_fini_rideck(void **);
  

• The flat associative array destructor routine:

  int x1f4_flat_rideck(void *);
  

• The flow data structure integrity check routine:

  int x1f4_flow_rideck(void *);
  

• The init associative array regular constructor routine:

  int x1f4_init_rideck(void **, unsigned, struct x1f4_rideck_type *);
  

• The list data traversal routine:

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

• The post plain data insertion routine:

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