---

3.2.1.7 Fixed Size Data Array Pointer Set Library

The pointer set library routines assume the data item size to be the pointer size. They order pointers as unsigned integers of pointer size.

Unlike the generic routines, the pointer set routines do not take as argument the address where the key is stored, but the key itself.

See Bitmapped B-tree Fixed Size Data Arrays.

• Plain data deletion routine.

  int x1f4_cast_??pset(void *, void *)
  

  looks for some $1 associative array item matching the $2 pointer. Upon look up success, deletes the found associative array element.

  returns 0 for success (deletion success that is), X1f4_??FSET_MISS_CLASS for nonexistent matching node, one of the defined errors for failure

• Plain search routine.

  int x1f4_find_??pset(void *, void *)
  

  looks for some $1 associative array item matching the $2 pointer.

  returns 0 if no match was found, non zero otherwise

• Data structure integrity check routine.

  int x1f4_flow_??pset(void *)
  

  checks the $1 sequence for integrity - useful only for debugging this library

  return 0 for success, non 0 for failure to complete the integrity tests

• Plain data insertion routine.

  int x1f4_post_??pset(void *, void *)
  

  looks for some $1 associative array item matching the $2 pointer. Upon look up failure inserts the $2 pointer.

  returns 0 if a new element was inserted, X1f4_??FSET_EVER_MATCH if a match was found, one of the defined errors for failure