comparison: ucx/cx/list.h
ucx/cx/list.h
- changeset 776
- 96555c0ed875
- parent 750
- 4d7a2238c5ac
equal
deleted
inserted
replaced
| 775:e5909dff0dbf | 776:96555c0ed875 |
|---|---|
| 75 * and SHALL deallocate the list memory, if an allocator is provided. | 75 * and SHALL deallocate the list memory, if an allocator is provided. |
| 76 */ | 76 */ |
| 77 void (*destructor)(struct cx_list_s *list); | 77 void (*destructor)(struct cx_list_s *list); |
| 78 | 78 |
| 79 /** | 79 /** |
| 80 * Member function for inserting a single elements. | 80 * Member function for inserting a single element. |
| 81 * Implementors SHOULD see to performant implementations for corner cases. | 81 * Implementors SHOULD see to performant implementations for corner cases. |
| 82 */ | 82 */ |
| 83 int (*insert_element)( | 83 int (*insert_element)( |
| 84 struct cx_list_s *list, | 84 struct cx_list_s *list, |
| 85 size_t index, | 85 size_t index, |
| 143 struct cx_list_s const *list, | 143 struct cx_list_s const *list, |
| 144 void const *elem | 144 void const *elem |
| 145 ); | 145 ); |
| 146 | 146 |
| 147 /** | 147 /** |
| 148 * Member function for sorting the list in place. | 148 * Member function for sorting the list in-place. |
| 149 */ | 149 */ |
| 150 void (*sort)(struct cx_list_s *list); | 150 void (*sort)(struct cx_list_s *list); |
| 151 | 151 |
| 152 /** | 152 /** |
| 153 * Member function for comparing this list to another list of the same type. | 153 * Member function for comparing this list to another list of the same type. |
| 582 ) { | 582 ) { |
| 583 return list->cl->find(list, elem); | 583 return list->cl->find(list, elem); |
| 584 } | 584 } |
| 585 | 585 |
| 586 /** | 586 /** |
| 587 * Sorts the list in place. | 587 * Sorts the list in-place. |
| 588 * | 588 * |
| 589 * \remark The underlying sort algorithm is implementation defined. | 589 * \remark The underlying sort algorithm is implementation defined. |
| 590 * | 590 * |
| 591 * @param list the list | 591 * @param list the list |
| 592 */ | 592 */ |
