Lely core libraries
2.3.4
|
Go to the documentation of this file.
25 #define LELY_UTIL_SLLIST_INLINE extern inline
41 *(list->plast =
pnode) = NULL;
54 if ((node = *
pnode)) {
84 return list->plast != &list->first
A node in a pairing heap.
struct slnode * next
A pointer to the next node in the list.
struct pnode * next
A pointer to the next sibling node.
int sllist_contains(const struct sllist *list, const struct slnode *node)
Checks if a node is part of a singly-linked list.
#define sllist_foreach(list, node)
Iterates in order over each node in a singly-linked list.
#define structof(ptr, type, member)
Obtains the address of a structure from the address of one of its members.
struct slnode * sllist_remove(struct sllist *list, struct slnode *node)
Removes a node from a singly-linked list.
A node in a singly-linked list.
struct slnode * sllist_pop_back(struct sllist *list)
Pops a node from the back of a singly-linked list.
struct slnode * sllist_last(const struct sllist *list)
Returns a pointer to the last node in a singly-linked list.