---

4.1.2.1 Radix Tree Associative Array

The least refined radix tree associative array is constructed over a path compressed trie. The trie is a character (byte) one, i.e. node selection uses 8 bits. Nodes having a common parent are stored as a sorted array - node selection is binary search derived. The trie is prefix compressed, i.e. common prefixes are stripped from keys and stored only once - it is possible for the data structure representation to require less memory than the sum of the stored key lengths.

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

General library:

See String Key Pointer Value Array Library.

• The case data structure state retriever:

  int x1f4_case_s3deck(void *);
  

• The cast plain data deletion routine:

  int x1f4_cast_s3deck(void *, const char *);
  

• The copy plain copy routine:

  int x1f4_copy_s3deck(void **, void *);
  

• The fast associative array constructor routine:

  int x1f4_fast_s3deck(void *, unsigned, struct x1f4_s3deck_type *);
  

• The find plain search routine:

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

• The find plain search routine:

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

• The fini associative array regular destructor routine:

  int x1f4_fini_s3deck(void **);
  

• The flat associative array destructor routine:

  int x1f4_flat_s3deck(void *);
  

• The hook data traversal routine:

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

• The init associative array regular constructor routine:

  int x1f4_init_s3deck(void **, unsigned, struct x1f4_s3deck_type *);
  

• The lime data traversal routine:

  int x1f4_lime_s3deck(void *, void *, int (*)(void *, void *));
  

• The list data traversal routine:

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

• The pass plain data deletion routine:

  int x1f4_pass_s3deck(void *, const char *);
  

• The pass plain data deletion routine:

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

• The pick plain search routine:

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

• The pick plain search routine:

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

• The post plain data insertion routine:

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

• The post plain data insertion routine:

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