# 2.4.1.1 Types

ZIX_BTREE_MAX_HEIGHT

  6U

  The maximum height of a `ZixBTree`.

  This is exposed because it determines the size of iterators, which are statically sized so they can used on the stack. The usual degree (or “fanout”) of a B-Tree is high enough that a relatively short tree can contain many elements. With the default page size of 4 KiB, the default height of 6 is enough to store trillions.

typedef struct ZixBTreeImpl ZixBTree

  A B-Tree.

typedef int (*ZixBTreeCompareFunc)(const void *a, const void *b, const void *user_data)

  Function for comparing two B-Tree elements.

typedef void (*ZixBTreeDestroyFunc)(void *ptr, const void *user_data)

  Function to destroy a B-Tree element.