Add const, pure, and malloc function attributes

1 files changed, 10 insertions, 10 deletions

diff --git a/zix/tree.h b/zix/tree.h
index 64b91f1..af8659e 100644
--- a/zix/tree.h
+++ b/zix/tree.h
@@ -61,7 +61,7 @@ zix_tree_free(ZixTree* t);
 /**
    Return the number of elements in `t`.
 */
-ZIX_API size_t
+ZIX_PURE_API size_t
 zix_tree_size(const ZixTree* t);
 
 /**
@@ -86,55 +86,55 @@ zix_tree_find(const ZixTree* t, const void* e, ZixTreeIter** ti);
 /**
    Return the data associated with the given tree item.
 */
-ZIX_API void*
+ZIX_PURE_API void*
 zix_tree_get(const ZixTreeIter* ti);
 
 /**
    Return an iterator to the first (smallest) element in `t`.
 */
-ZIX_API ZixTreeIter*
+ZIX_PURE_API ZixTreeIter*
 zix_tree_begin(ZixTree* t);
 
 /**
    Return an iterator the the element one past the last element in `t`.
 */
-ZIX_API ZixTreeIter*
+ZIX_CONST_API ZixTreeIter*
 zix_tree_end(ZixTree* t);
 
 /**
    Return true iff `i` is an iterator to the end of its tree.
 */
-ZIX_API bool
+ZIX_CONST_API bool
 zix_tree_iter_is_end(const ZixTreeIter* i);
 
 /**
    Return an iterator to the last (largest) element in `t`.
 */
-ZIX_API ZixTreeIter*
+ZIX_PURE_API ZixTreeIter*
 zix_tree_rbegin(ZixTree* t);
 
 /**
    Return an iterator the the element one before the first element in `t`.
 */
-ZIX_API ZixTreeIter*
+ZIX_CONST_API ZixTreeIter*
 zix_tree_rend(ZixTree* t);
 
 /**
    Return true iff `i` is an iterator to the reverse end of its tree.
 */
-ZIX_API bool
+ZIX_CONST_API bool
 zix_tree_iter_is_rend(const ZixTreeIter* i);
 
 /**
    Return an iterator that points to the element one past `i`.
 */
-ZIX_API ZixTreeIter*
+ZIX_PURE_API ZixTreeIter*
 zix_tree_iter_next(ZixTreeIter* i);
 
 /**
    Return an iterator that points to the element one before `i`.
 */
-ZIX_API ZixTreeIter*
+ZIX_PURE_API ZixTreeIter*
 zix_tree_iter_prev(ZixTreeIter* i);
 
 /**