Format all code with clang-format

1 files changed, 32 insertions, 17 deletions

diff --git a/zix/tree.h b/zix/tree.h
index af8659e..c340fc0 100644
--- a/zix/tree.h
+++ b/zix/tree.h
@@ -46,7 +46,8 @@ typedef struct ZixTreeNodeImpl ZixTreeIter;
 /**
    Create a new (empty) tree.
 */
-ZIX_API ZixTree*
+ZIX_API
+ZixTree*
 zix_tree_new(bool           allow_duplicates,
              ZixComparator  cmp,
              void*          cmp_data,
@@ -55,86 +56,100 @@ zix_tree_new(bool           allow_duplicates,
 /**
    Free `t`.
 */
-ZIX_API void
+ZIX_API
+void
 zix_tree_free(ZixTree* t);
 
 /**
    Return the number of elements in `t`.
 */
-ZIX_PURE_API size_t
+ZIX_PURE_API
+size_t
 zix_tree_size(const ZixTree* t);
 
 /**
    Insert the element `e` into `t` and point `ti` at the new element.
 */
-ZIX_API ZixStatus
+ZIX_API
+ZixStatus
 zix_tree_insert(ZixTree* t, void* e, ZixTreeIter** ti);
 
 /**
    Remove the item pointed at by `ti` from `t`.
 */
-ZIX_API ZixStatus
+ZIX_API
+ZixStatus
 zix_tree_remove(ZixTree* t, ZixTreeIter* ti);
 
 /**
    Set `ti` to an element equal to `e` in `t`.
    If no such item exists, `ti` is set to NULL.
 */
-ZIX_API ZixStatus
+ZIX_API
+ZixStatus
 zix_tree_find(const ZixTree* t, const void* e, ZixTreeIter** ti);
 
 /**
    Return the data associated with the given tree item.
 */
-ZIX_PURE_API void*
+ZIX_PURE_API
+void*
 zix_tree_get(const ZixTreeIter* ti);
 
 /**
    Return an iterator to the first (smallest) element in `t`.
 */
-ZIX_PURE_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_CONST_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_CONST_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_PURE_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_CONST_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_CONST_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_PURE_API ZixTreeIter*
+ZIX_PURE_API
+ZixTreeIter*
 zix_tree_iter_next(ZixTreeIter* i);
 
 /**
    Return an iterator that points to the element one before `i`.
 */
-ZIX_PURE_API ZixTreeIter*
+ZIX_PURE_API
+ZixTreeIter*
 zix_tree_iter_prev(ZixTreeIter* i);
 
 /**
@@ -143,7 +158,7 @@ zix_tree_iter_prev(ZixTreeIter* i);
 */
 
 #ifdef __cplusplus
-}  /* extern "C" */
+} /* extern "C" */
 #endif
 
-#endif  /* ZIX_TREE_H */
+#endif /* ZIX_TREE_H */