ucx/cx/linked_list.h

branch
dav-2
changeset 886
da79af4baec8
parent 854
1c8401ece69e
child 889
42cdbf9bbd49
--- a/ucx/cx/linked_list.h	Tue Sep 09 16:01:30 2025 +0200
+++ b/ucx/cx/linked_list.h	Tue Sep 09 20:56:47 2025 +0200
@@ -51,7 +51,7 @@
  * to cx_cmp_ptr(), if none is given.
  *
  * @param allocator the allocator for allocating the list nodes
- * (if @c NULL, a default stdlib allocator will be used)
+ * (if @c NULL, the cxDefaultAllocator will be used)
  * @param comparator the comparator for the elements
  * (if @c NULL, and the list is not storing pointers, sort and find
  * functions will not work)
@@ -77,7 +77,7 @@
  *
  * If @p elem_size is #CX_STORE_POINTERS, the created list stores pointers instead of
  * copies of the added elements and the compare function will be automatically set
- * to cx_cmp_ptr(), if none is given.
+ * to cx_cmp_ptr().
  *
  * @param elem_size (@c size_t) the size of each element in bytes
  * @return (@c CxList*) the created list
@@ -393,7 +393,7 @@
  * @li @p loc_next and @p loc_prev (ancestor node is determined by using the prev pointer, overall O(1) performance)
  * @li @p loc_next and @p begin (ancestor node is determined by list traversal, overall O(n) performance)
  *
- * @remark The @c next and @c prev pointers of the removed node are not cleared by this function and may still be used
+ * @remark The @c next and @c prev pointers of the removed chain are not cleared by this function and may still be used
  * to traverse to a former adjacent node in the list, or within the chain.
  *
  * @param begin a pointer to the beginning node pointer (optional)

mercurial