Go to the source code of this file.
◆ INT_QUEUE_DESTROY
#define INT_QUEUE_DESTROY |
( |
| prQueue | ) |
|
Value:
#define INT_LIST_DESTROY(prList)
Definition list.h:80
◆ INT_QUEUE_EMPTY
#define INT_QUEUE_EMPTY |
( |
| prQueue | ) |
|
Value:
#define INT_LIST_SIZE(prList)
Definition list.h:90
◆ INT_QUEUE_INIT
#define INT_QUEUE_INIT |
( |
| prQueue | ) |
|
Value:
#define INT_LIST_INIT(prList)
Definition list.h:78
◆ INT_QUEUE_POP
#define INT_QUEUE_POP |
( |
| prQueue, |
|
|
| data ) |
Value:
int IntListRemoveNext(list_t *prList, list_elem_t *prElement, int *iData_p)
Remove next element from current element/position.
Definition list.c:240
◆ INT_QUEUE_PUSH
#define INT_QUEUE_PUSH |
( |
| prQueue, |
|
|
| data ) |
Value:
#define INT_LIST_APPEND(prList, data)
Definition list.h:84
◆ QUEUE_DESTROY
#define QUEUE_DESTROY |
( |
| prQueue | ) |
|
Value:
void ListDestroy(list_t *prList)
Calls user defined function to free data in list and resets the list to NULL. Call even if your destr...
Definition list.c:78
◆ QUEUE_EMPTY
#define QUEUE_EMPTY |
( |
| prQueue | ) |
|
Value:
#define LIST_SIZE(prList)
Definition list.h:53
◆ QUEUE_INIT
#define QUEUE_INIT |
( |
| prQueue, |
|
|
| destroy_func ) |
Value:
void ListInit(list_t *prList, void(*destroy)(void *data))
Initialise data members of a list.
Definition list.c:57
◆ QUEUE_POP
#define QUEUE_POP |
( |
| prQueue, |
|
|
| data ) |
Value:
int ListRemoveNext(list_t *prList, list_elem_t *prElement, void **pvData_p)
Remove next element from current element/position.
Definition list.c:158
◆ QUEUE_PUSH
#define QUEUE_PUSH |
( |
| prQueue, |
|
|
| data ) |
Value:
#define LIST_APPEND(prList, data)
Definition list.h:47
◆ int_queue_t
◆ queue_t