Mercurial > hg > ucx / file diff

--- a/src/cx/array_list.h	Wed Sep 18 00:02:18 2024 +0200
+++ b/src/cx/array_list.h	Sat Sep 28 15:47:28 2024 +0200
@@ -164,7 +164,7 @@
         size_t *size,
         size_t *capacity,
         size_t index,
-        void const *src,
+        const void *src,
         size_t elem_size,
         size_t elem_count,
         struct cx_array_reallocator_s *reallocator
@@ -241,7 +241,7 @@
         size_t *size,
         size_t *capacity,
         cx_compare_func cmp_func,
-        void const *src,
+        const void *src,
         size_t elem_size,
         size_t elem_count,
         struct cx_array_reallocator_s *reallocator
@@ -316,10 +316,10 @@
  * @return the index of the largest lower bound, or \p size
  */
 size_t cx_array_binary_search_inf(
-        void const *arr,
+        const void *arr,
         size_t size,
         size_t elem_size,
-        void const *elem,
+        const void *elem,
         cx_compare_func cmp_func
 ) __attribute__((__nonnull__));
 
@@ -339,16 +339,16 @@
  */
 __attribute__((__nonnull__))
 static inline size_t cx_array_binary_search(
-        void const *arr,
+        const void *arr,
         size_t size,
         size_t elem_size,
-        void const *elem,
+        const void *elem,
         cx_compare_func cmp_func
 ) {
     size_t index = cx_array_binary_search_inf(
             arr, size, elem_size, elem, cmp_func
     );
-    if (index < size && cmp_func(((char const *) arr) + index * elem_size, elem) == 0) {
+    if (index < size && cmp_func(((const char *) arr) + index * elem_size, elem) == 0) {
         return index;
     } else {
         return size;
@@ -377,17 +377,17 @@
  */
 __attribute__((__nonnull__))
 static inline size_t cx_array_binary_search_sup(
-        void const *arr,
+        const void *arr,
         size_t size,
         size_t elem_size,
-        void const *elem,
+        const void *elem,
         cx_compare_func cmp_func
 ) {
     size_t inf = cx_array_binary_search_inf(arr, size, elem_size, elem, cmp_func);
     if (inf == size) {
         // no infimum means, first element is supremum
         return 0;
-    } else if (cmp_func(((char const *) arr) + inf * elem_size, elem) == 0) {
+    } else if (cmp_func(((const char *) arr) + inf * elem_size, elem) == 0) {
         return inf;
     } else {
         return inf + 1;
@@ -426,7 +426,7 @@
  * @return the created list
  */
 CxList *cxArrayListCreate(
-        CxAllocator const *allocator,
+        const CxAllocator *allocator,
         cx_compare_func comparator,
         size_t elem_size,
         size_t initial_capacity