B-tree Associative Array (libx1f4l2)

3.2.2.5 B-tree Associative Array

Types:

typedef struct x1f4_bqfset_type {
    int (*fare)(void *, void *), (*look)(void *, void *, unsigned *),
	(*move)(void *, void *, unsigned),
	(*pick)(void *, void *, unsigned *);
    unsigned size;
    void *trans;
} x1f4_bqfset_type;

See Fixed Size Data Array Types.

The extra features in the struct x1f4_bqfset_type are the fare, look, move and pick function pointer fields, indicating the data comparison, root node data placing, data move and non root node data placing methods, correspondingly.

The default for data item size (used when X1f4_BQFSET_SIZE_FRAME if not included in the flags list parameter of the associative array constructor) is the size of pointer.

See Fixed Size Data Array Definitions.

For a restricted set of pointer set uses the struct x1f4_bqfset_type argument of the constructor routines, although required, may be supplied unset.

typedef struct x1f4_bqnorm_type {
    int (*fare)(void *, void *), (*look)(void *, void *, unsigned *),
	(*move)(void *, void *, unsigned),
	(*pick)(void *, void *, unsigned *);
} x1f4_bqnorm_type;

General library:

See Fixed Size Data Array Library.

See Fixed Size Data Array Search Library.

See Fixed Size Data Array Traversal Library.

The call data structure size retriever:
```
int x1f4_call_bqfset(unsigned *);
```
The case data structure state retriever:
```
int x1f4_case_bqfset(void *);
```
The cast plain data deletion routine:
```
int x1f4_cast_bqfset(void *, void *);
```

The draw data backward traversal routine:

int x1f4_draw_bqfset(void *, void *, int (*)(void *, void *));

The ever record retriever:
```
int x1f4_ever_bqfset(void *, void **);
```

The fast associative array constructor routine:

int x1f4_fast_bqfset(void *, unsigned, struct x1f4_bqfset_type *);

The fgpd greater traversal routine:

int x1f4_fgpd_bqfset(void *, void *, void *, int (*)(void *, void *));

The fgxd first greater search routine:

int x1f4_fgxd_bqfset(void *, void *, void **);

The find plain search routine:

int x1f4_find_bqfset(void *, void *, void **);

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

The fmxd first matching search routine:

int x1f4_fmxd_bqfset(void *, void *, void **);

The fxpd greater or matching traversal routine:

int x1f4_fxpd_bqfset(void *, void *, void *, int (*)(void *, void *));

The fxxd first greater or matching search routine:

int x1f4_fxxd_bqfset(void *, void *, void **);

The high data purge routine:
```
int x1f4_high_bqfset(void *);
```

The init associative array regular constructor routine:

int x1f4_init_bqfset(void **, unsigned, struct x1f4_bqfset_type *);

The join associative array consolidation routine:
```
int x1f4_join_bqfset(void *, void *);
```
The lead record retriever:
```
int x1f4_lead_bqfset(void *, void **);
```

The lime data traversal routine:

int x1f4_lime_bqfset(void *, void *, int (*)(void *, void *));

The line data copy routine:

int x1f4_line_bqfset
    (void *, void *, int (*)(void *, void *, const void *),
     int (*)(void *, void *), void *);

The llpd lesser traversal routine:

int x1f4_llpd_bqfset(void *, void *, void *, int (*)(void *, void *));

The llxd last less search routine:

int x1f4_llxd_bqfset(void *, void *, void **);

The lmxd last matching search routine:

int x1f4_lmxd_bqfset(void *, void *, void **);

The lxpd lesser or matching traversal routine:

int x1f4_lxpd_bqfset(void *, void *, void *, int (*)(void *, void *));

The lxxd last less or matching search routine:

int x1f4_lxxd_bqfset(void *, void *, void **);

The mind data deletion routine:
```
int x1f4_mind_bqfset(void *);
```
The function uses only one of the user supplied methods, move.

The norm data methods replacement routine:

int x1f4_norm_bqfset(void *, const struct x1f4_bqnorm_type *);

The post plain data insertion routine:

int x1f4_post_bqfset(void *, void *, void **);

The rest data deletion routine:

int x1f4_rest_bqfset(void *, void *, unsigned);

The sink data deletion routine:

int x1f4_sink_bqfset(void *, void *, unsigned);

The size size retriever:
```
int x1f4_size_bqfset(void *, unsigned *);
```
The function visits every b-tree node.
The slip data deletion routine:
```
int x1f4_slip_bqfset(void *);
```
The function uses only one of the user supplied methods, move.
The swap data swap routine:
```
int x1f4_swap_bqfset(void *, void *);
```

The tear associative array partition routine:

int x1f4_tear_bqfset(void *, void *, int, void *);

Pointer set library:

See Fixed Size Data Array Pointer Set Library.

The cast plain data deletion routine:
```
int x1f4_cast_bqpset(void *, void *);
```
The find plain search routine:
```
int x1f4_find_bqpset(void *, void *);
```
The flow data structure integrity check routine:
```
int x1f4_flow_bqpset(void *);
```
The post plain data insertion routine:
```
int x1f4_post_bqpset(void *, void *);
```

The pointer set library uses none of the four user supplied methods.