ENet list management. More...
#include <stdlib.h>
Data Structures | |
struct | _ENetList |
struct | _ENetListNode |
Macros | |
#define | enet_list_back(list) ((void *) (list) -> sentinel.previous) |
#define | enet_list_begin(list) ((list) -> sentinel.next) |
#define | enet_list_empty(list) (enet_list_begin (list) == enet_list_end (list)) |
#define | enet_list_end(list) (& (list) -> sentinel) |
#define | enet_list_front(list) ((void *) (list) -> sentinel.next) |
#define | enet_list_next(iterator) ((iterator) -> next) |
#define | enet_list_previous(iterator) ((iterator) -> previous) |
Typedefs | |
typedef struct _ENetList | ENetList |
typedef ENetListNode * | ENetListIterator |
typedef struct _ENetListNode | ENetListNode |
Functions | |
void | enet_list_clear (ENetList *) |
ENetListIterator | enet_list_insert (ENetListIterator, void *) |
ENetListIterator | enet_list_move (ENetListIterator, void *, void *) |
void * | enet_list_remove (ENetListIterator) |
size_t | enet_list_size (ENetList *) |
ENet list management.
#define enet_list_back | ( | list | ) | ((void *) (list) -> sentinel.previous) |
#define enet_list_begin | ( | list | ) | ((list) -> sentinel.next) |
#define enet_list_empty | ( | list | ) | (enet_list_begin (list) == enet_list_end (list)) |
#define enet_list_end | ( | list | ) | (& (list) -> sentinel) |
#define enet_list_front | ( | list | ) | ((void *) (list) -> sentinel.next) |
#define enet_list_next | ( | iterator | ) | ((iterator) -> next) |
#define enet_list_previous | ( | iterator | ) | ((iterator) -> previous) |
typedef ENetListNode* ENetListIterator |
typedef struct _ENetListNode ENetListNode |