Adaptative Radix Tree Associative Array (libx1f4l2)

4.1.2.9 Adaptative Radix Tree Associative Array

The radix tree associative array switches the tree node coding between the coding of the 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.

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_sideck(void *);
```

The cast plain data deletion routine:

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

The copy plain copy routine:
```
int x1f4_copy_sideck(void **, void *);
```

The fast associative array constructor routine:

int x1f4_fast_sideck(void *, unsigned, struct x1f4_sideck_type *);

The fill data copy routine:
```
int x1f4_fill_sideck(void *, void *);
```

The find plain search routine:

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

The fini associative array regular destructor routine:
```
int x1f4_fini_sideck(void **);
```
The flat associative array destructor routine:
```
int x1f4_flat_sideck(void *);
```
The flow data structure integrity check routine:
```
int x1f4_flow_sideck(void *);
```

The fxxz first greater or matching search routine:

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

The init associative array regular constructor routine:

int x1f4_init_sideck(void **, unsigned, struct x1f4_sideck_type *);

The jack memory allocator definition retriever:
```
int x1f4_jack_sideck(void *, void *);
```
The join associative array consolidation routine:
```
int x1f4_join_sideck(void *, void *);
```

The lime data traversal routine:

int x1f4_lime_sideck(void *, void *, int (*)(void *, void *));

The list data traversal routine:

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

The lxxz last less or matching search routine:

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

The post plain data insertion routine:

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

The rush supporting tree visiting routine:
```
int x1f4_rush_sideck
    (void *, unsigned type, void *,
     int (*)(void *, unsigned depth, unsigned fanout, unsigned size));
```
type is the node type for which statistics are to be collected, one of 'A', 'G', 'J', 'L' and 'X', selecting compact sorted array nodes, front coded nodes, bitmapped nodes, lookup array nodes and multi byte selection nodes respectively, 0 for all types
The skew memory allocator replacer routine:
```
int x1f4_skew_sideck(void *, void *);
```

The tear associative array partition routine:

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