Mercurial > hg > ucx / file diff

--- a/docs/Writerside/topics/list.h.md	Tue Dec 16 21:33:58 2025 +0100
+++ b/docs/Writerside/topics/list.h.md	Wed Dec 17 19:05:50 2025 +0100
@@ -474,7 +474,7 @@
 If you want to create your own list implementation, this is extremely easy.
 
 You need to define a function for creating your list and assign a `cx_list_class` structure with the pointers to your implementation.
-Then you call the `cx_list_init()` helper function to initialize the collection sture.
+Then you call the `cx_list_init()` helper function to initialize the collection structure.
 This also automatically adds support for `CX_STORE_POINTERS` to your list. 
 
 ```C
@@ -544,10 +544,6 @@
 | `change_capacity` | When your list supports overallocation, the capacity shall be changed to the specified value. Return non-zero on error and zero on success. When the list does not support overallocation, this function pointer can be `NULL`.                                                                                            |
 | `iterator`        | Create an iterator starting at the specified index. The Boolean argument indicates whether iteration is supposed to traverse backwards.                                                                                                                                                                                    |
 
-> If you initialize your list with `cx_list_init()`, you do not have to worry about making a
-> difference between storing pointers and storing elements, because your implementation will
-> be automatically wrapped.
-> This means you only have to handle the one single case described above.
 
 ### Default Class Function Implementations