Mercurial > hg > ucx / file diff

--- a/docs/Writerside/topics/linked_list.h.md	Sat Oct 11 15:42:48 2025 +0200
+++ b/docs/Writerside/topics/linked_list.h.md	Sun Oct 12 20:21:56 2025 +0200
@@ -59,7 +59,7 @@
 If true, the function terminates and returns the current node.
 Otherwise, it moves on with the search.
 If `begin` is already the searched `node`, this function immediately returns `NULL` as there is no predecessor.
-Note carefully, that the behavior of this function is not defined when `node` is not contained in the list that starts with `begin`.
+Note carefully that the behavior of this function is not defined when `node` is not contained in the list that starts with `begin`.
 
 > It is advisable to use the low-level functions inside own custom functions that you define particularly for your lists.
 > Otherwise you will get a lot of boilerplate code when specifying the offsets to the pointers in your node structure in every call
@@ -208,7 +208,7 @@
         void *node, size_t num);
 ```
 
-You can either remove a single element or a specified number of subsequent elements from list.
+You can either remove a single element or a specified number of subsequent elements from the list.
 
 The function `cx_linked_list_remove()` is equivalent to `cx_linked_list_remove_chain()` where `num` is set to one.
 
@@ -272,7 +272,7 @@
 But it is also possible to start with the _last_ node of both lists and use the `prev` pointer to compare them backwards.
 
 The `loc_data` offset is used to calculate the pointer that is passed to the `cmp_fnc`.
-This can either be the offset of a specific field in the struct, or simply zero in which case the pointers to the nodes themselves are passed to the compare function.
+This can either be the offset of a specific field in the struct or simply zero, in which case the pointers to the nodes themselves are passed to the compare function.
 
 <seealso>
 <category ref="apidoc">