Windows/Visual C++ portability.

git-svn-id: http://svn.drobilla.net/zix/trunk@51 df6676b4-ccc9-40e5-b5d6-7c4628a128e3

1 files changed, 15 insertions, 1 deletions

diff --git a/zix/tree.h b/zix/tree.h
index 378db28..b54087c 100644
--- a/zix/tree.h
+++ b/zix/tree.h
@@ -17,7 +17,6 @@
 #ifndef ZIX_TREE_H
 #define ZIX_TREE_H
 
-#include <stdbool.h>
 #include <stddef.h>
 
 #include "zix/common.h"
@@ -46,6 +45,7 @@ typedef struct ZixTreeNodeImpl ZixTreeIter;
 /**
    Create a new (empty) tree.
 */
+ZIX_API
 ZixTree*
 zix_tree_new(bool           allow_duplicates,
              ZixComparator  cmp,
@@ -55,24 +55,28 @@ zix_tree_new(bool           allow_duplicates,
 /**
    Free @a t.
 */
+ZIX_API
 void
 zix_tree_free(ZixTree* t);
 
 /**
    Return the number of elements in @a t.
 */
+ZIX_API
 size_t
 zix_tree_size(ZixTree* t);
 
 /**
    Insert the element @a e into @a t and point @a ti at the new element.
 */
+ZIX_API
 ZixStatus
 zix_tree_insert(ZixTree* t, void* e, ZixTreeIter** ti);
 
 /**
    Remove the item pointed at by @a ti from @a t.
 */
+ZIX_API
 ZixStatus
 zix_tree_remove(ZixTree* t, ZixTreeIter* ti);
 
@@ -80,60 +84,70 @@ zix_tree_remove(ZixTree* t, ZixTreeIter* ti);
    Set @a ti to an element equal to @a e in @a t.
    If no such item exists, @a ti is set to NULL.
 */
+ZIX_API
 ZixStatus
 zix_tree_find(const ZixTree* t, const void* e, ZixTreeIter** ti);
 
 /**
    Return the data associated with the given tree item.
 */
+ZIX_API
 void*
 zix_tree_get(ZixTreeIter* ti);
 
 /**
    Return an iterator to the first (smallest) element in @a t.
 */
+ZIX_API
 ZixTreeIter*
 zix_tree_begin(ZixTree* t);
 
 /**
    Return an iterator the the element one past the last element in @a t.
 */
+ZIX_API
 ZixTreeIter*
 zix_tree_end(ZixTree* t);
 
 /**
    Return true iff @a i is an iterator to the end of its tree.
 */
+ZIX_API
 bool
 zix_tree_iter_is_end(ZixTreeIter* i);
 
 /**
    Return an iterator to the last (largest) element in @a t.
 */
+ZIX_API
 ZixTreeIter*
 zix_tree_rbegin(ZixTree* t);
 
 /**
    Return an iterator the the element one before the first element in @a t.
 */
+ZIX_API
 ZixTreeIter*
 zix_tree_rend(ZixTree* t);
 
 /**
    Return true iff @a i is an iterator to the reverse end of its tree.
 */
+ZIX_API
 bool
 zix_tree_iter_is_rend(ZixTreeIter* i);
 
 /**
    Return an iterator that points to the element one past @a i.
 */
+ZIX_API
 ZixTreeIter*
 zix_tree_iter_next(ZixTreeIter* i);
 
 /**
    Return an iterator that points to the element one before @a i.
 */
+ZIX_API
 ZixTreeIter*
 zix_tree_iter_prev(ZixTreeIter* i);