---

4.1.1.5 String Key Pointer Value Array Search Library

• First greater search routine.

  int x1f4_fgvq_??deck
      (void *, const char *, const void ***, char **, unsigned *, unsigned *)
  

  looks up the $1 associative array node corresponding the first key greater than $2 and upon look up success, stores the address of the found node payload (i.e. where the node stores its pointer value) at $3, its corresponding string key at some address to be found at $4 and the string key length at $5.

  The function expects some storage space available at the pointer readable at $4 and its capacity recorded at $6. The minimum expect storage capacity is 1 byte. If the space available at the pointer readable at $4 is large enough to store the string key, the x1f4_fgvq_??deck function uses it for the string key storage. If not, it reallocates the storage space large enough for the string key storage, stores the string key in the reallocated space and records the new storage space address and size back at $4 and $6.

  The memory at the address stored at $4 may be modified even for function failures.

  $2 may be the pointer stored at $4.

  returns 0 for look up success, X1f4_??DECK_MISS_CLASS for look up failure (no node corresponding a greater key exists), one of the defined errors for other failure conditions

• First greater search routine.

  int x1f4_fgxd_??deck(void *, const char *, const void ***)
  

  looks up the $1 associative array node corresponding the first key greater than $2 and upon look up success, stores the address of the found node payload (i.e. where the node stores its pointer value) at $3

  returns 0 if no match was found, non zero otherwise

• First greater or matching search routine.

  int x1f4_fxxd_??deck(void *, const char *, const void ***)
  

  looks up the $1 associative array node corresponding the first key greater or matching $2 and upon look up success, stores the address of the found node payload (i.e. where the node stores its pointer value) at $3

  returns 0 if no match was found, non zero otherwise

• First greater or matching search routine.

  int x1f4_fxxz_??path(void *, const char *, unsigned, const void **)
  

  looks up the $1 associative array node corresponding the first key greater or matching $3 bytes long $2 and upon look up success, stores the found node payload (i.e. the node pointer value) at $4

  returns 0 if no match was found, non zero otherwise

• Last less search routine.

  int x1f4_llvq_??deck
      (void *, const char *, const void ***, char **, unsigned *, unsigned *)
  

  looks up the $1 associative array node corresponding the last key less than $2 and upon look up success, stores the address of the found node payload (i.e. where the node stores its pointer value) at $3, its corresponding string key at some address to be found at $4 and the string key length at $5.

  The function expects some storage space available at the pointer readable at $4 and its capacity recorded at $6. The minimum expect storage capacity is 1 byte. If the space available at the pointer readable at $4 is large enough to store the string key, the x1f4_llvq_??deck function uses it for the string key storage. If not, it reallocates the storage space large enough for the string key storage, stores the string key in the reallocated space and records the new storage space address and size back at $4 and $6.

  The memory at the address stored at $4 may be modified even for function failures.

  $2 may be the pointer stored at $4.

  returns 0 for look up success, X1f4_??DECK_MISS_CLASS for look up failure (no node corresponding a lesser key exists), one of the defined errors for other failure conditions

• Last less search routine.

  int x1f4_llxd_??deck(void *, const char *, const void ***)
  

  looks up the $1 associative array node corresponding the last key less than $2 and upon look up success, stores the address of the found node payload (i.e. where the node stores its pointer value) at $3

  returns 0 if no match was found, non zero otherwise

• Last less or matching search routine.

  int x1f4_lxxd_??deck(void *, const char *, const void ***)
  

  looks up the $1 associative array node corresponding the last key less or matching $2 and upon look up success, stores the address of the found node payload (i.e. where the node stores its pointer value) at $3

  returns 0 if no match was found, non zero otherwise

• Last less or matching search routine.

  int x1f4_lxxz_??path(void *, const char *, unsigned, const void **)
  

  looks up the $1 associative array node corresponding the last key less or matching $3 bytes long $2 and upon look up success, stores the found node payload (i.e. the node pointer value) at $4

  returns 0 if no match was found, non zero otherwise