Mercurial > hg > ucx / file diff

--- a/src/tree.c	Wed Sep 18 00:02:18 2024 +0200
+++ b/src/tree.c	Sat Sep 28 15:47:28 2024 +0200
@@ -134,8 +134,8 @@
 }
 
 int cx_tree_search(
-        void const *root,
-        void const *node,
+        const void *root,
+        const void *node,
         cx_tree_search_func sfunc,
         void **result,
         ptrdiff_t loc_children,
@@ -154,7 +154,7 @@
     }
 
     // create a working stack
-    CX_ARRAY_DECLARE(void const*, work);
+    CX_ARRAY_DECLARE(const void *, work);
     cx_array_initialize(work, 32);
 
     // add the children of root to the working stack
@@ -174,7 +174,7 @@
     // process the working stack
     while (work_size > 0) {
         // pop element
-        void const *elem = work[--work_size];
+        const void *elem = work[--work_size];
 
         // apply the search function
         ret = sfunc(elem, node);
@@ -212,8 +212,8 @@
 }
 
 int cx_tree_search_data(
-        void const *root,
-        void const *data,
+        const void *root,
+        const void *data,
         cx_tree_search_data_func sfunc,
         void **result,
         ptrdiff_t loc_children,
@@ -227,13 +227,13 @@
             loc_children, loc_next);
 }
 
-static bool cx_tree_iter_valid(void const *it) {
-    struct cx_tree_iterator_s const *iter = it;
+static bool cx_tree_iter_valid(const void *it) {
+    const struct cx_tree_iterator_s *iter = it;
     return iter->node != NULL;
 }
 
-static void *cx_tree_iter_current(void const *it) {
-    struct cx_tree_iterator_s const *iter = it;
+static void *cx_tree_iter_current(const void *it) {
+    const struct cx_tree_iterator_s *iter = it;
     return iter->node;
 }
 
@@ -351,13 +351,13 @@
     return iter;
 }
 
-static bool cx_tree_visitor_valid(void const *it) {
-    struct cx_tree_visitor_s const *iter = it;
+static bool cx_tree_visitor_valid(const void *it) {
+    const struct cx_tree_visitor_s *iter = it;
     return iter->node != NULL;
 }
 
-static void *cx_tree_visitor_current(void const *it) {
-    struct cx_tree_visitor_s const *iter = it;
+static void *cx_tree_visitor_current(const void *it) {
+    const struct cx_tree_visitor_s *iter = it;
     return iter->node;
 }
 
@@ -497,7 +497,7 @@
 }
 
 int cx_tree_add(
-        void const *src,
+        const void *src,
         cx_tree_search_func sfunc,
         cx_tree_node_create_func cfunc,
         void *cdata,
@@ -560,7 +560,7 @@
 
     size_t processed = 0;
     void *current_node = root;
-    void const *elem;
+    const void *elem;
 
     for (void **eptr;
          iter->valid(iter) && (eptr = iter->current(iter)) != NULL;
@@ -621,7 +621,7 @@
 }
 
 size_t cx_tree_add_array(
-        void const *src,
+        const void *src,
         size_t num,
         size_t elem_size,
         cx_tree_search_func sfunc,