58 void *(*current)(
const void *);
63 void *(*current_impl)(
const void *);
94#define CX_ITERATOR_BASE struct cx_iterator_base_s base
153#define cxIteratorValid(iter) (iter).base.valid(&(iter))
164#define cxIteratorCurrent(iter) (iter).base.current(&iter)
171#define cxIteratorNext(iter) (iter).base.next(&iter)
179#define cxIteratorFlagRemoval(iter) ((iter).base.remove = (iter).base.allow_remove)
188#define cx_foreach(type, elem, iter) \
189for (type elem; cxIteratorValid(iter) && (elem = (type)cxIteratorCurrent(iter)) != NULL ; cxIteratorNext(iter))
Common definitions and feature checks.
#define CX_NODISCARD
Warn about discarded return value.
Definition common.h:256
#define CX_EXTERN
Declares a function with external linkage.
Definition common.h:297
struct cx_iterator_s CxIterator
Iterator type.
Definition iterator.h:144
#define CX_ITERATOR_BASE
Declares base attributes for an iterator.
Definition iterator.h:94
CxIterator cxIteratorPtr(const void *array, size_t elem_count)
Creates an iterator for the specified plain pointer array.
CxIterator cxIterator(const void *array, size_t elem_size, size_t elem_count)
Creates an iterator for the specified plain array.
struct cx_iterator_base_s CxIteratorBase
Convenience type definition for the base structure of an iterator.
Definition iterator.h:88
Common data for all iterators.
Definition iterator.h:44
bool(* valid_impl)(const void *)
Original implementation in case the function needs to be wrapped.
Definition iterator.h:52
bool allow_remove
Indicates whether this iterator may remove elements.
Definition iterator.h:77
bool remove
Internal flag for removing the current element when advancing.
Definition iterator.h:81
void(* next_impl)(void *)
Original implementation in case the function needs to be wrapped.
Definition iterator.h:73
bool(* valid)(const void *)
True if the iterator points to valid data.
Definition iterator.h:48
void(* next)(void *)
Advances the iterator.
Definition iterator.h:69
Internal iterator struct - use CxIterator.
Definition iterator.h:99
size_t elem_count
May contain the total number of elements, if known.
Definition iterator.h:130
void * elem_handle
Handle for the current element.
Definition iterator.h:108
size_t index
If the iterator is position-aware, contains the index of the element in the underlying collection.
Definition iterator.h:119
void * src_handle
Handle for the source collection, if any.
Definition iterator.h:113
size_t elem_size
The size of an individual element.
Definition iterator.h:124