diff options
author | David Robillard <d@drobilla.net> | 2020-12-31 15:36:04 +0100 |
---|---|---|
committer | David Robillard <d@drobilla.net> | 2020-12-31 15:36:04 +0100 |
commit | ad23cd354165b6c2926d8f23636010a3e0ea85ea (patch) | |
tree | 093d9123bafc51e07c6e3ee0c9d0d54593b96fe7 /src/tree.c | |
parent | ed9a6e98b8e4e010117e1228333569aa31c51d9e (diff) | |
download | zix-ad23cd354165b6c2926d8f23636010a3e0ea85ea.tar.gz zix-ad23cd354165b6c2926d8f23636010a3e0ea85ea.tar.bz2 zix-ad23cd354165b6c2926d8f23636010a3e0ea85ea.zip |
Remove ZIX_PRIVATE and ZIX_INLINE mechanisms
A normal C library ought to be good enough for anybody.
Diffstat (limited to 'src/tree.c')
-rw-r--r-- | src/tree.c | 21 |
1 files changed, 7 insertions, 14 deletions
@@ -82,8 +82,7 @@ zix_tree_new(bool allow_duplicates, return t; } -ZIX_PRIVATE -void +static void zix_tree_free_rec(ZixTree* t, ZixTreeNode* n) { if (n) { @@ -111,8 +110,7 @@ zix_tree_size(const ZixTree* t) return t->size; } -ZIX_PRIVATE -void +static void rotate(ZixTreeNode* p, ZixTreeNode* q) { assert(q->parent == p); @@ -156,8 +154,7 @@ rotate(ZixTreeNode* p, ZixTreeNode* q) * / \ / \ * B C A B */ -ZIX_PRIVATE -ZixTreeNode* +static ZixTreeNode* rotate_left(ZixTreeNode* p, int* height_change) { ZixTreeNode* const q = p->right; @@ -190,8 +187,7 @@ rotate_left(ZixTreeNode* p, int* height_change) * A B B C * */ -ZIX_PRIVATE -ZixTreeNode* +static ZixTreeNode* rotate_right(ZixTreeNode* p, int* height_change) { ZixTreeNode* const q = p->left; @@ -226,8 +222,7 @@ rotate_right(ZixTreeNode* p, int* height_change) * B C * */ -ZIX_PRIVATE -ZixTreeNode* +static ZixTreeNode* rotate_left_right(ZixTreeNode* p, int* height_change) { ZixTreeNode* const q = p->left; @@ -274,8 +269,7 @@ rotate_left_right(ZixTreeNode* p, int* height_change) * B C * */ -ZIX_PRIVATE -ZixTreeNode* +static ZixTreeNode* rotate_right_left(ZixTreeNode* p, int* height_change) { ZixTreeNode* const q = p->right; @@ -311,8 +305,7 @@ rotate_right_left(ZixTreeNode* p, int* height_change) return r; } -ZIX_PRIVATE -ZixTreeNode* +static ZixTreeNode* zix_tree_rebalance(ZixTree* t, ZixTreeNode* node, int* height_change) { #ifdef ZIX_TREE_HYPER_VERIFY |