docs/Writerside/topics/list.h.md

branch
docs/3.1
changeset 1142
9437530176bc
parent 1141
a06a2d27c043
child 1143
0559812df10c
equal deleted inserted replaced
1141:a06a2d27c043 1142:9437530176bc
6 But if you feel the need to implement an own list, the only thing you need to do is to define a struct with a 6 But if you feel the need to implement an own list, the only thing you need to do is to define a struct with a
7 `struct cx_list_s` as first member, and set an appropriate list class that implements the functionality. 7 `struct cx_list_s` as first member, and set an appropriate list class that implements the functionality.
8 It is strongly recommended that this class is shared among all instances of the same list type, because otherwise 8 It is strongly recommended that this class is shared among all instances of the same list type, because otherwise
9 the `cxListCompare` function cannot use the optimized implementation of your class and will instead fall back to 9 the `cxListCompare` function cannot use the optimized implementation of your class and will instead fall back to
10 using iterators to compare the contents element-wise. 10 using iterators to compare the contents element-wise.
11
12 ## Undocumented Symbols (TODO)
13 ### cx_empty_list
14 ### cxEmptyList
15 ### cxListCompare
16 ### cx_list_default_insert_array
17 ### cx_list_default_insert_sorted
18 ### cx_list_default_sort
19 ### cx_list_default_swap
20 ### cxListFree
21 ### cx_list_init
22 ### cxListMutBackwardsIteratorAt
23 ### cxListMutIteratorAt
24

mercurial