| 126 ) { |
126 ) { |
| 127 void **ptr = list->climpl->at(list, index); |
127 void **ptr = list->climpl->at(list, index); |
| 128 return ptr == NULL ? NULL : *ptr; |
128 return ptr == NULL ? NULL : *ptr; |
| 129 } |
129 } |
| 130 |
130 |
| 131 static ssize_t cx_pl_find_remove( |
131 static size_t cx_pl_find_remove( |
| 132 struct cx_list_s *list, |
132 struct cx_list_s *list, |
| 133 const void *elem, |
133 const void *elem, |
| 134 bool remove |
134 bool remove |
| 135 ) { |
135 ) { |
| 136 cx_pl_hack_cmpfunc(list); |
136 cx_pl_hack_cmpfunc(list); |
| 137 ssize_t ret = list->climpl->find_remove(list, &elem, remove); |
137 size_t ret = list->climpl->find_remove(list, &elem, remove); |
| 138 cx_pl_unhack_cmpfunc(list); |
138 cx_pl_unhack_cmpfunc(list); |
| 139 return ret; |
139 return ret; |
| 140 } |
140 } |
| 141 |
141 |
| 142 static void cx_pl_sort(struct cx_list_s *list) { |
142 static void cx_pl_sort(struct cx_list_s *list) { |
| 205 cx_attr_unused size_t index |
205 cx_attr_unused size_t index |
| 206 ) { |
206 ) { |
| 207 return NULL; |
207 return NULL; |
| 208 } |
208 } |
| 209 |
209 |
| 210 static ssize_t cx_emptyl_find_remove( |
210 static size_t cx_emptyl_find_remove( |
| 211 cx_attr_unused struct cx_list_s *list, |
211 cx_attr_unused struct cx_list_s *list, |
| 212 cx_attr_unused const void *elem, |
212 cx_attr_unused const void *elem, |
| 213 cx_attr_unused bool remove |
213 cx_attr_unused bool remove |
| 214 ) { |
214 ) { |
| 215 return -1; |
215 return 0; |
| 216 } |
216 } |
| 217 |
217 |
| 218 static bool cx_emptyl_iter_valid(cx_attr_unused const void *iter) { |
218 static bool cx_emptyl_iter_valid(cx_attr_unused const void *iter) { |
| 219 return false; |
219 return false; |
| 220 } |
220 } |