The great formattening!

1 files changed, 19 insertions, 22 deletions

diff --git a/include/engine/btree.h b/include/engine/btree.h
index 5405e7e..04f9ff8 100644
--- a/include/engine/btree.h
+++ b/include/engine/btree.h
@@ -8,9 +8,9 @@
 #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 )
+#define BTREE_CMP_LT (-1)
+#define BTREE_CMP_EQ (0)
+#define BTREE_CMP_GT (1)
 
 struct btree;
 struct btree_iter_t;
@@ -22,36 +22,33 @@ struct btree_iter_t;
  * 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));
+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*));
+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_free(struct btree** btree);
 
-void*  btree_search(struct btree *btree, void *elem);
-void   btree_insert(struct btree *btree, void *elem);
-int    btree_delete(struct btree *btree, void *elem);
+void* btree_search(struct btree* btree, void* elem);
+void btree_insert(struct btree* btree, void* elem);
+int btree_delete(struct btree* btree, void* elem);
 
-void   btree_print(struct btree *btree, void (*print_elem)(const void*));
+void btree_print(struct btree* btree, void (*print_elem)(const void*));
 
-void*  btree_first(struct btree *btree);
-void*  btree_last(struct btree *btree);
+void* btree_first(struct btree* btree);
+void* btree_last(struct btree* btree);
 
-size_t btree_size(struct btree *btree);
+size_t btree_size(struct btree* btree);
 
 struct btree_iter_t* btree_iter_t_new(struct btree* tree);
-void                 btree_iter_t_reset(struct btree *tree, struct btree_iter_t** it);
+void btree_iter_t_reset(struct btree* tree, struct btree_iter_t** it);
 
-void*  btree_iter(struct btree *tree, struct btree_iter_t *iter);
+void* btree_iter(struct btree* tree, struct btree_iter_t* iter);
 
 #endif