summaryrefslogtreecommitdiff
path: root/src/btree.h
diff options
context:
space:
mode:
Diffstat (limited to 'src/btree.h')
-rw-r--r--src/btree.h20
1 files changed, 11 insertions, 9 deletions
diff --git a/src/btree.h b/src/btree.h
index 95acf22..397d813 100644
--- a/src/btree.h
+++ b/src/btree.h
@@ -21,23 +21,25 @@ struct btree;
* This function just calls `btree_new_with_allocator` with `free` and `malloc`
* as initializers.
*/
-struct btree *btree_new(size_t elem_size,
+struct btree* btree_new(size_t elem_size,
size_t t,
- int(*cmp)(const void *a, const void *b));
+ 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,
+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*));
+ 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);
+void* btree_search(struct btree *btree, void *elem);
+void* btree_insert(struct btree *btree, void *elem);
+void* btree_delete(struct btree *btree, void *elem);
+void* btree_update(struct btree *btree, void *elem_key, void *elem);
#endif