µEvLoop
A fast and lightweight event loop aimed at embedded platforms in C99.
|
Go to the documentation of this file.
41 void * (* next)(uel_iterator_t *,
void *);
73 size_t uel_iterator_map(uel_iterator_t *iterator, uel_closure_t *closure,
void **destination,
size_t limit);
178 #define UEL_ITERATOR_MAP_BOUNDLESS UINT_MAX
size_t uel_iterator_map(uel_iterator_t *iterator, uel_closure_t *closure, void **destination, size_t limit)
Applies a closure to an enumerable collection and stores its results.
uel_iterator_array_t uel_iterator_array_create(void *collection, size_t count, size_t size)
Creates a new array iterator.
Defines a simple implementation of linked lists and functions to manipulate it.
size_t item_size
The size of each element in the array.
Definition: iterator.h:131
void * uel_iterator_find(uel_iterator_t *iterator, uel_closure_t *closure)
Finds the first element enumerated by an iterator that passes the supplied test.
Defines closures, objects that bind functions to creating and calling contexts.
bool uel_iterator_any(uel_iterator_t *iterator, uel_closure_t *closure)
Determines whether any elements enumerated by an iterator pass the supplied test or not.
uel_iterator_t base
The base iterator interface.
Definition: iterator.h:127
void * uel_iterator_array_next(uel_iterator_array_t *iterator, void *last)
Yields elements in a array.
size_t uel_iterator_count(uel_iterator_t *iterator, uel_closure_t *closure)
Counts elements enumerated by an iterator that pass the supplied test.
bool uel_iterator_all(uel_iterator_t *iterator, uel_closure_t *closure)
Determines whether all elements enumerated by an iterator pass the supplied test or not.
bool uel_iterator_foreach(uel_iterator_t *iterator, uel_closure_t *closure)
Applies a closure to an enumerable collection.
uel_iterator_llist_t uel_iterator_llist_create(uel_llist_t *list)
Creates a new linked list iterator.
uel_iterator_t uel_iterator_llist_t
Alias to uel_iterator_t. Iterator suitable to traverse linked lists.
Definition: iterator.h:158
bool uel_iterator_none(uel_iterator_t *iterator, uel_closure_t *closure)
Determines whether all elements enumerated by an iterator fail the supplied test or not.
Iterators are data structures that wrap arbitrary collections of data and define ways of enumerating ...
Definition: iterator.h:29
void * collection
A reference to the collection being iterated.
Definition: iterator.h:43
void * uel_iterator_llist_next(uel_iterator_t *iterator, void *last)
Yields elements in a linked list.
size_t item_count
The number of elements in the array.
Definition: iterator.h:129
A specialised iterator suitable for iterating over arrays of arbitrary data.
Definition: iterator.h:125