sds_bptree_instance - Man Page

uint32_t checksum
uint16_t offline_checksumming
uint16_t search_checksumming
uint16_t print_iter
sds_bptree_node * root
void(* value_free_fn )(void *value)
void *(* value_dup_fn )(void *value)
int64_t(* key_cmp_fn )(void *a, void *b)
void(* key_free_fn )(void *key)
void *(* key_dup_fn )(void *key)

checksum of the instance data​.

Key comparison function​. This must return an int64_t of the difference in the values​. A result of < 0 indicates that a is less than b​. A result of 0 indicates that the values of a and b are identical​. A result of > 0 indicates that a is greater than b​.

Key duplication function​. This duplicates the value of key and returns a new pointer to it​. This is used extensively in the tree structure, and the key or result may be freed out of order, so don't blindly return the same data​.

Key free function​. This must free the pointer provided by key​.

This flag determines if we maintain and update checksum values during tree operations, and that we verify these during the verification operation​.

Internal tracking id for tree display​.

Pointer to the current tree root node​.

This flag determines if we verify all checksums during the read and write paths of the code​. Adds a large performance overhead, but guarantees the data in the tree is "consistent"​.

This function should be able to duplicate value of the type that will be inserted into the tree​. Values may be freed and duplicated in an order you do not expect, so blindly returning a pointer to the same data may not be wise if free then destroys it​.

This function should be able to free values of the type that will be inserted into the tree​.