62 void *(*current)(
const void *);
67 void *(*current_impl)(
const void *);
98#define CX_ITERATOR_BASE struct cx_iterator_base_s base
157#define cxIteratorValid(iter) (iter).base.valid(&(iter))
168#define cxIteratorCurrent(iter) (iter).base.current(&iter)
175#define cxIteratorNext(iter) (iter).base.next(&iter)
183#define cxIteratorFlagRemoval(iter) ((iter).base.remove = (iter).base.allow_remove)
193#define cxIteratorRef(iter) &((iter).base)
202#define cx_foreach(type, elem, iter) \
203for (type elem; cxIteratorValid(iter) && (elem = (type)cxIteratorCurrent(iter)) != NULL ; cxIteratorNext(iter))
264 bool remove_keeps_order);
Common definitions and feature checks.
#define CX_EXPORT
Only used for building Windows DLLs.
Definition common.h:278
#define cx_attr_nodiscard
Warn about discarded return value.
Definition common.h:256
struct cx_iterator_s CxIterator
Iterator type.
Definition iterator.h:148
CxIterator cxIteratorPtr(const void *array, size_t elem_count, bool remove_keeps_order)
Creates an iterator for the specified plain pointer array.
#define CX_ITERATOR_BASE
Declares base attributes for an iterator.
Definition iterator.h:98
CxIterator cxIterator(const void *array, size_t elem_size, size_t elem_count, bool remove_keeps_order)
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:92
Common data for all iterators.
Definition iterator.h:48
bool(* valid_impl)(const void *)
Original implementation in case the function needs to be wrapped.
Definition iterator.h:56
bool allow_remove
Indicates whether this iterator may remove elements.
Definition iterator.h:81
bool remove
Internal flag for removing the current element when advancing.
Definition iterator.h:85
void(* next_impl)(void *)
Original implementation in case the function needs to be wrapped.
Definition iterator.h:77
bool(* valid)(const void *)
True if the iterator points to valid data.
Definition iterator.h:52
void(* next)(void *)
Advances the iterator.
Definition iterator.h:73
Internal iterator struct - use CxIterator.
Definition iterator.h:103
size_t elem_count
May contain the total number of elements, if known.
Definition iterator.h:134
void * elem_handle
Handle for the current element.
Definition iterator.h:112
size_t index
If the iterator is position-aware, contains the index of the element in the underlying collection.
Definition iterator.h:123
void * src_handle
Handle for the source collection, if any.
Definition iterator.h:117
size_t elem_size
The size of an individual element.
Definition iterator.h:128