Multibyte Radix Tree Associative Array (libx1f4l2)

4.1.2.5 Multibyte Radix Tree Associative Array

The multibyte radix tree associative array uses 1, 2 or 4 bytes for node selection. It otherwise preserves the characteristics of the inlined radix tree associative array.

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

General library:

See String Key Pointer Value Array Library.

The fast associative array constructor routine:

int x1f4_fast_sxdeck(void *, unsigned, struct x1f4_sxdeck_type *);

The find plain search routine:

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

The fini associative array regular destructor routine:
```
int x1f4_fini_sxdeck(void **);
```
The flat associative array destructor routine:
```
int x1f4_flat_sxdeck(void *);
```

The init associative array regular constructor routine:

int x1f4_init_sxdeck(void **, unsigned, struct x1f4_sxdeck_type *);

The lime data traversal routine:

int x1f4_lime_sxdeck(void *, void *, int (*)(void *, void *));

The list data traversal routine:

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

The post plain data insertion routine:

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

The rush supporting tree visiting routine:
```
int x1f4_rush_sxdeck
    (void *, unsigned order, void *,
     int (*)(void *, unsigned depth, unsigned fanout));
```
order is the number of node selection bits: 8, 16 and 32 to pick 1, 2 and 4 bytes nodes respectively, 0 to include all nodes.

The scan supporting tree visiting routine:

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