diff options
author | David Robillard <d@drobilla.net> | 2011-09-06 20:09:27 +0000 |
---|---|---|
committer | David Robillard <d@drobilla.net> | 2011-09-06 20:09:27 +0000 |
commit | d7d36c2a5899818827c72a2cbb2ea0626a238f15 (patch) | |
tree | d64ebd2e9615ad437c4392f875d1c372915621fc | |
parent | 5883df8b03a5dba1f8d7075b5a7bb61c35a8784e (diff) | |
download | zix-d7d36c2a5899818827c72a2cbb2ea0626a238f15.tar.gz zix-d7d36c2a5899818827c72a2cbb2ea0626a238f15.tar.bz2 zix-d7d36c2a5899818827c72a2cbb2ea0626a238f15.zip |
Use e.g. ZixTreeImpl instead of _ZixTree for type names.
git-svn-id: http://svn.drobilla.net/zix/trunk@7 df6676b4-ccc9-40e5-b5d6-7c4628a128e3
-rw-r--r-- | src/tree.c | 16 | ||||
-rw-r--r-- | zix/tree.h | 4 |
2 files changed, 10 insertions, 10 deletions
@@ -30,19 +30,19 @@ #define MIN(a, b) (((a) < (b)) ? (a) : (b)) #define MAX(a, b) (((a) > (b)) ? (a) : (b)) -struct _ZixTree { +struct ZixTreeImpl { ZixTreeNode* root; ZixComparator cmp; void* cmp_data; bool allow_duplicates; }; -struct _ZixTreeNode { - const void* data; - struct _ZixTreeNode* left; - struct _ZixTreeNode* right; - struct _ZixTreeNode* parent; - int_fast8_t balance; +struct ZixTreeNodeImpl { + const void* data; + struct ZixTreeNodeImpl* left; + struct ZixTreeNodeImpl* right; + struct ZixTreeNodeImpl* parent; + int_fast8_t balance; }; #ifdef ZIX_TREE_DUMP @@ -73,7 +73,7 @@ ZIX_API ZixTree* zix_tree_new(bool allow_duplicates, ZixComparator cmp, void* cmp_data) { - ZixTree* t = malloc(sizeof(struct _ZixTree)); + ZixTree* t = malloc(sizeof(ZixTree)); t->root = NULL; t->cmp = cmp; t->cmp_data = cmp_data; @@ -40,12 +40,12 @@ typedef int (*ZixComparator)(const void* a, const void* b, void* user_data); /** A balanced binary search tree. */ -typedef struct _ZixTree ZixTree; +typedef struct ZixTreeImpl ZixTree; /** A node in a @ref ZixTree. */ -typedef struct _ZixTreeNode ZixTreeNode; +typedef struct ZixTreeNodeImpl ZixTreeNode; /** An iterator over a @ref ZixTree. |