Next: Parent Pointer red/black Associative Array, Previous: Parent Pointer AVL Associative Array, Up: BST Based Variable Size Data Arrays [Index]
General library:
See Variable Size Data Array Library.
See Variable Size Data Array Search Library.
base
data structure node size retriever:
int x1f4_base_tnline(unsigned *);
case
data structure state retriever:
int x1f4_case_tnline(void *);
cast
plain data deletion routine:
int x1f4_cast_tnline (void *, void *, int (*)(void *, void *), unsigned);
ever
record retriever:
int x1f4_ever_tnline(void *, void **);
fast
associative array constructor routine:
int x1f4_fast_tnline(void *, unsigned, struct x1f4_tnline_type *);
find
plain search routine:
int x1f4_find_tnline (void *, void *, unsigned, int (*)(void *, void *), void **);
fini
associative array regular destructor routine:
int x1f4_fini_tnline(void **);
flat
associative array destructor routine:
int x1f4_flat_tnline(void *);
high
data purge routine:
int x1f4_high_tnline(void *);
init
associative array regular constructor routine:
int x1f4_init_tnline(void **, unsigned, struct x1f4_tnline_type *);
land
plain data insertion routine:
int x1f4_land_tnline (void *, void *, int (*)(void *, void *), unsigned, unsigned, void **);
lead
record retriever:
int x1f4_lead_tnline(void *, void **);
lime
data traversal routine:
int x1f4_lime_tnline(void *, void *, int (*)(void *, void *));
near
plain data deletion routine:
int x1f4_near_tnline (void *, void *, int (*)(void *, void *), unsigned, void *, int (*)(void *, void *));
pass
plain data deletion routine:
int x1f4_pass_tnline (void *, void *, int (*)(void *, void *), unsigned);
post
plain data insertion routine:
int x1f4_post_tnline (void *, void *, int (*)(void *, void *), unsigned, unsigned, void **);
scan
supporting tree visiting routine:
int x1f4_scan_tnline (void *, void *, int (*)(void *, void *, unsigned));
shut
plain data deletion routine:
int x1f4_shut_tnline (void *, void *, int (*)(void *, void *), unsigned, void *, int (*)(void *, void *));