ucx: comparison src/cx/list.h

-:f549fd9fbd8f
+:54565fd74e74
 struct cx_list_s {
 CX_COLLECTION_BASE;
 /**
 * The list class definition.
 */
-cx_list_class const *cl;
+const cx_list_class *cl;
 /**
 * The actual implementation in case the list class is delegating.
 */
-cx_list_class const *climpl;
+const cx_list_class *climpl;
 };
 /**
 * The class definition for arbitrary lists.
 */
 * Implementors SHOULD see to performant implementations for corner cases.
 */
 int (*insert_element)(
 struct cx_list_s *list,
 size_t index,
-void const *data
+const void *data
 );
 /**
 * Member function for inserting multiple elements.
 * Implementors SHOULD see to performant implementations for corner cases.
 * @see cx_list_default_insert_array()
 */
 size_t (*insert_array)(
 struct cx_list_s *list,
 size_t index,
-void const *data,
+const void *data,
 size_t n
 );
 /**
 * Member function for inserting sorted elements into a sorted list.
 *
 * @see cx_list_default_insert_sorted()
 */
 size_t (*insert_sorted)(
 struct cx_list_s *list,
-void const *sorted_data,
+const void *sorted_data,
 size_t n
 );
 /**
 * Member function for inserting an element relative to an iterator position.
 */
 int (*insert_iter)(
 struct cx_iterator_s *iter,
-void const *elem,
+const void *elem,
 int prepend
 );
 /**
 * Member function for removing an element.
 /**
 * Member function for element lookup.
 */
 void *(*at)(
-struct cx_list_s const *list,
+const struct cx_list_s *list,
 size_t index
 );
 /**
 * Member function for finding and optionally removing an element.
 */
 ssize_t (*find_remove)(
 struct cx_list_s *list,
-void const *elem,
+const void *elem,
 bool remove
 );
 /**
 * Member function for sorting the list in-place.
 * Optional member function for comparing this list
 * to another list of the same type.
 * If set to \c NULL, comparison won't be optimized.
 */
 int (*compare)(
-struct cx_list_s const *list,
+const struct cx_list_s *list,
-struct cx_list_s const *other
+const struct cx_list_s *other
 );
 /**
 * Member function for reversing the order of the items.
 */
 /**
 * Member function for returning an iterator pointing to the specified index.
 */
 struct cx_iterator_s (*iterator)(
-struct cx_list_s const *list,
+const struct cx_list_s *list,
 size_t index,
 bool backward
 );
 };
 */
 __attribute__((__nonnull__))
 size_t cx_list_default_insert_array(
 struct cx_list_s *list,
 size_t index,
-void const *data,
+const void *data,
 size_t n
 );
 /**
 * Default implementation of a sorted insert.
 * @return the number of elements actually inserted
 */
 __attribute__((__nonnull__))
 size_t cx_list_default_insert_sorted(
 struct cx_list_s *list,
-void const *sorted_data,
+const void *sorted_data,
 size_t n
 );
 /**
 * Default unoptimized sort implementation.
 * @param list
 * @return true, if this list is storing pointers
 * @see cxListStorePointers()
 */
 __attribute__((__nonnull__))
-static inline bool cxListIsStoringPointers(CxList const *list) {
+static inline bool cxListIsStoringPointers(const CxList *list) {
 return list->collection.store_pointer;
 }
 /**
 * Returns the number of elements currently stored in the list.
 *
 * @param list the list
 * @return the number of currently stored elements
 */
 __attribute__((__nonnull__))
-static inline size_t cxListSize(CxList const *list) {
+static inline size_t cxListSize(const CxList *list) {
 return list->collection.size;
 }
 /**
 * Adds an item to the end of the list.
 * @see cxListAddArray()
 */
 __attribute__((__nonnull__))
 static inline int cxListAdd(
 CxList *list,
-void const *elem
+const void *elem
 ) {
 return list->cl->insert_element(list, list->collection.size, elem);
 }
 /**
 * @return the number of added elements
 */
 __attribute__((__nonnull__))
 static inline size_t cxListAddArray(
 CxList *list,
-void const *array,
+const void *array,
 size_t n
 ) {
 return list->cl->insert_array(list, list->collection.size, array, n);
 }
 */
 __attribute__((__nonnull__))
 static inline int cxListInsert(
 CxList *list,
 size_t index,
-void const *elem
+const void *elem
 ) {
 return list->cl->insert_element(list, index, elem);
 }
 /**
 * @return zero on success, non-zero on memory allocation failure
 */
 __attribute__((__nonnull__))
 static inline int cxListInsertSorted(
 CxList *list,
-void const *elem
+const void *elem
 ) {
-void const *data = list->collection.store_pointer ? &elem : elem;
+const void *data = list->collection.store_pointer ? &elem : elem;
 return list->cl->insert_sorted(list, data, 1) == 0;
 }
 /**
 * Inserts multiple items to the list at the specified index.
 */
 __attribute__((__nonnull__))
 static inline size_t cxListInsertArray(
 CxList *list,
 size_t index,
-void const *array,
+const void *array,
 size_t n
 ) {
 return list->cl->insert_array(list, index, array, n);
 }
 * @return the number of added elements
 */
 __attribute__((__nonnull__))
 static inline size_t cxListInsertSortedArray(
 CxList *list,
-void const *array,
+const void *array,
 size_t n
 ) {
 return list->cl->insert_sorted(list, array, n);
 }
 * @see cxListInsertBefore()
 */
 __attribute__((__nonnull__))
 static inline int cxListInsertAfter(
 CxIterator *iter,
-void const *elem
+const void *elem
 ) {
 return ((struct cx_list_s *) iter->src_handle.m)->cl->insert_iter(iter, elem, 0);
 }
 /**
 * @see cxListInsertAfter()
 */
 __attribute__((__nonnull__))
 static inline int cxListInsertBefore(
 CxIterator *iter,
-void const *elem
+const void *elem
 ) {
 return ((struct cx_list_s *) iter->src_handle.m)->cl->insert_iter(iter, elem, 1);
 }
 /**
 * @param index the index where the iterator shall point at
 * @return a new iterator
 */
 __attribute__((__nonnull__, __warn_unused_result__))
 static inline CxIterator cxListIteratorAt(
-CxList const *list,
+const CxList *list,
 size_t index
 ) {
 return list->cl->iterator(list, index, false);
 }
 * @param index the index where the iterator shall point at
 * @return a new iterator
 */
 __attribute__((__nonnull__, __warn_unused_result__))
 static inline CxIterator cxListBackwardsIteratorAt(
-CxList const *list,
+const CxList *list,
 size_t index
 ) {
 return list->cl->iterator(list, index, true);
 }
 *
 * @param list the list
 * @return a new iterator
 */
 __attribute__((__nonnull__, __warn_unused_result__))
-static inline CxIterator cxListIterator(CxList const *list) {
+static inline CxIterator cxListIterator(const CxList *list) {
 return list->cl->iterator(list, 0, false);
 }
 /**
 * Returns a mutating iterator pointing to the first item of the list.
 *
 * @param list the list
 * @return a new iterator
 */
 __attribute__((__nonnull__, __warn_unused_result__))
-static inline CxIterator cxListBackwardsIterator(CxList const *list) {
+static inline CxIterator cxListBackwardsIterator(const CxList *list) {
 return list->cl->iterator(list, list->collection.size - 1, true);
 }
 /**
 * Returns a mutating backwards iterator pointing to the last item of the list.
 * @return the index of the element or a negative
 * value when the element is not found
 */
 __attribute__((__nonnull__))
 static inline ssize_t cxListFind(
-CxList const *list,
+const CxList *list,
-void const *elem
+const void *elem
 ) {
 return list->cl->find_remove((CxList*)list, elem, false);
 }
 /**
 * value when the element is not found or could not be removed
 */
 __attribute__((__nonnull__))
 static inline ssize_t cxListFindRemove(
 CxList *list,
-void const *elem
+const void *elem
 ) {
 return list->cl->find_remove(list, elem, true);
 }
 /**
 * @return zero, if both lists are equal element wise,
 * negative if the first list is smaller, positive if the first list is larger
 */
 __attribute__((__nonnull__))
 int cxListCompare(
-CxList const *list,
+const CxList *list,
-CxList const *other
+const CxList *other
 );
 /**
 * Deallocates the memory of the specified list structure.
 *

Mercurial > hg > ucx / file comparison

comparison: src/cx/list.h

src/cx/list.h