From 9802644a3c6f7d4de289b425eb5ac76a07a0f523 Mon Sep 17 00:00:00 2001 From: 0scar Date: Thu, 16 Sep 2021 20:55:43 +0200 Subject: Add template for btrees --- src/btree.h | 43 +++++++++++++++++++++++++++++++++++++++++++ 1 file changed, 43 insertions(+) create mode 100644 src/btree.h (limited to 'src/btree.h') diff --git a/src/btree.h b/src/btree.h new file mode 100644 index 0000000..95acf22 --- /dev/null +++ b/src/btree.h @@ -0,0 +1,43 @@ +#ifndef BTREE_H +#define BTREE_H + +#include + +#define BTREE_DEGREE_DEFAULT 4 + +#define BTREE_SIZE_MIN 8 +#define BTREE_SIZE_MAX 4096 + +#define BTREE_CMP_LT ( -1 ) +#define BTREE_CMP_EQ ( 0 ) +#define BTREE_CMP_GT ( 1 ) + +struct btree; + +/* elem_size: the size of the elements, typically `sizeof(struct )` + * t: degree of the btree, if you're in doubt, use `BTREE_SIZE_DEFAULT` + * cmp: comparison function, in order to support any operations on the tree. + * + * This function just calls `btree_new_with_allocator` with `free` and `malloc` + * as initializers. + */ +struct btree *btree_new(size_t elem_size, + size_t t, + int(*cmp)(const void *a, const void *b)); + +/* Same as `btree_new`, except that it actually initializes a btree, but with + * the given allocators. + */ +struct btree *btree_new_with_allocator(size_t elem_size, + size_t t, + int(*cmp)(const void *a, const void *b), + void *(*alloc)(size_t), + void (*dealloc)(void*)); + +void btree_free(struct btree *btree); + +void *btree_search(struct btree *btree, void *elem); +void *btree_insert(struct btree *btree, void *elem); +void *btree_delete(struct btree *btree, void *elem); + +#endif -- cgit v1.3