src/kv_list.c

changeset 1419
e46406fd1b3c
parent 1405
0f6515875a09
equal deleted inserted replaced
1418:5e1579713bcf 1419:e46406fd1b3c
136 ) { 136 ) {
137 cx_kv_list *kv_list = (cx_kv_list*)list; 137 cx_kv_list *kv_list = (cx_kv_list*)list;
138 return kv_list->list_methods->insert_sorted(list, sorted_data, n); 138 return kv_list->list_methods->insert_sorted(list, sorted_data, n);
139 } 139 }
140 140
141 static size_t cx_kvl_insert_unique(
142 struct cx_list_s *list,
143 const void *sorted_data,
144 size_t n
145 ) {
146 cx_kv_list *kv_list = (cx_kv_list*)list;
147 return kv_list->list_methods->insert_unique(list, sorted_data, n);
148 }
149
141 static int cx_kvl_insert_iter( 150 static int cx_kvl_insert_iter(
142 struct cx_iterator_s *iter, 151 struct cx_iterator_s *iter,
143 const void *elem, 152 const void *elem,
144 int prepend 153 int prepend
145 ) { 154 ) {
501 static cx_list_class cx_kv_list_class = { 510 static cx_list_class cx_kv_list_class = {
502 cx_kvl_deallocate, 511 cx_kvl_deallocate,
503 cx_kvl_insert_element, 512 cx_kvl_insert_element,
504 cx_kvl_insert_array, 513 cx_kvl_insert_array,
505 cx_kvl_insert_sorted, 514 cx_kvl_insert_sorted,
515 cx_kvl_insert_unique,
506 cx_kvl_insert_iter, 516 cx_kvl_insert_iter,
507 cx_kvl_remove, 517 cx_kvl_remove,
508 cx_kvl_clear, 518 cx_kvl_clear,
509 cx_kvl_swap, 519 cx_kvl_swap,
510 cx_kvl_at, 520 cx_kvl_at,

mercurial