---

2.2.2.1 Dynamic BST Internal And Leaf Nodes Sequence

Both the B-tree external nodes and the B-tree internal nodes are organized as self balancing binary seach trees.

Types:

typedef struct x1f4_qcrate_type {
    unsigned rate, size;
    void *trans;
} x1f4_qcrate_type;

See Fixed Size Data Sequence Types.

The extra feature in the struct x1f4_qcrate_type is the rate unsigned field, specifying log 2 the maximal population count to be stored in B-tree nodes. Field usage is restricted to express request and a sensible default value is provided for it.

Construction definitions:

X1f4_QCRATE_RATE_FRAME ¶

indicates the sequence constructor routines that the log 2 the maximal population count to be stored in internal B-tree nodes specified by the rate field of their struct x1f4_qcrate_type * argument is to be observed.

General library:

See Fixed Size Data Sequence Library.

• The fast sequence constructor routine:

  int x1f4_fast_qcrate(void *, unsigned, struct x1f4_qcrate_type *);
  

• The fini sequence regular destructor routine:

  int x1f4_fini_qcrate(void **);
  

• The flat sequence destructor routine:

  int x1f4_flat_qcrate(void *);
  

• The init sequence regular constructor routine:

  int x1f4_init_qcrate(void **, unsigned, struct x1f4_qcrate_type *);
  

• The lime data traversal routine:

  int x1f4_lime_qcrate(void *, void *, int (*)(void *, void *));
  

• The peek plain data retrieval routine:

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

• The push plain data insertion routine:

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