* hashvector combines a vector (for contents) with fill and hole
* counters, and itemkeyfun callback functions for abstracting items
* as being pairs of key and payload.
+ * \extends vector
*/
typedef struct {
/**
#include <tupleitem.h>
/**
- * A relation is an implementation of a tuple set with (optinal) key
+ * A relation is an implementation of a tuple set with (optional) key
* constraints. The store is a hashvector whose "type" is a
* tupleschema that defines the columns. The key constraints are
* represented as additional hashvectors whose tupleschemas are clones
* of the column schema with some columns excluded.
+ * \extends hashvector
*/
typedef struct {
/**
* macro \ref TUPLEITEMINIT may be used to initialize particular
* tupleschema records, which each become tupleitem declaration for
* its particular arity and parts declarations
+ * \extends itemkeyfun
*/
typedef struct {
/**
*/
typedef struct {
/**
- * The indexing variant. 0 = 8-bit, 1 = 4-bit, and 2 = 2-bit
- * indexing parts. This gives 256, 16 or 4 slots per index page.
- * Note that variant should not be changed after initialization.
+ * The indexing variant.
*/
enum vector_variant variant;