comparison: docs/Writerside/topics/linked_list.h.md
docs/Writerside/topics/linked_list.h.md
- changeset 1605
- 55b13f583356
- parent 1537
- f60a73d2ad01
equal
deleted
inserted
replaced
| 1604:68b75c091028 | 1605:55b13f583356 |
|---|---|
| 10 #include <cx/linked_list.h> | 10 #include <cx/linked_list.h> |
| 11 | 11 |
| 12 typedef struct cx_linked_list_s cx_linked_list; | 12 typedef struct cx_linked_list_s cx_linked_list; |
| 13 | 13 |
| 14 CxList *cxLinkedListCreate(const CxAllocator *allocator, | 14 CxList *cxLinkedListCreate(const CxAllocator *allocator, |
| 15 cx_compare_func comparator, size_t elem_size); | 15 size_t elem_size); |
| 16 | |
| 17 CxList *cxLinkedListCreateSimple(size_t elem_size); | |
| 18 ``` | 16 ``` |
| 19 | 17 |
| 20 If you are using high-level linked lists to implement your own list structure, | 18 If you are using high-level linked lists to implement your own list structure, |
| 21 it might be necessary to store additional data in each node that does not belong to the elements. | 19 it might be necessary to store additional data in each node that does not belong to the elements. |
| 22 For this purpose, there exists the following function. | 20 For this purpose, there exists the following function. |
