Go to the source code of this file.
Data Structures | |
| struct | XDLItem_tag |
| A list item. More... | |
| struct | XDList_tag |
| A list. More... | |
Defines | |
| #define | XDL_IS_HEAD(x) ((x)->isHead) |
| Is node x the head of the list? | |
| #define | XDL_IS_EMPTY(h) ((((h)->next == (h)) && ((h)->prev == (h)) )? 1: 0) |
| Is list empty? | |
| #define | XDL_INSERT(n, x) |
Insert an item into h after node x. | |
| #define | XDL_INSERT_AFTER XDL_INSERT |
| Just like XDL_INSERT. | |
| #define | XDL_INSERT_BEFORE(n, x) |
Insert n before x. | |
| #define | XDL_INSERT_WORKNODE_LAST(n, x) |
| Insert last. | |
| #define | XDL_INSERT_WORKNODE_FIRST(n, x) |
| Insert first. | |
| #define | XDL_UNLINK(x) |
Delete node x. | |
| #define | XDL_IS_LAST(h, x) (((x)->prev == (h) && (h)->prev == (x))? 1: 0) |
Given the head of the list h, determine if x is last. | |
| #define | XDL_IS_FIRST(h, x) (((x)->prev == (h) && (h)->next == (x))? 1: 0) |
Given the head of the list h, determine if x is first. | |
| #define | XDL_IS_ONLY(h, x) (((x)->next == (h) && (h)->prev == (x))? 1: 0) |
Given the head of the list h, determine if x is the only node. | |
| #define | XDL_LINK_HEAD(d, s) |
| The link-in-a-node macro. | |
Typedefs | |
| typedef struct XDLItem_tag | XDLItem |
| A list item. | |
| typedef struct XDList_tag | XDList |
| A list. | |
Functions | |
| XDLItem * | xdasd_list_unlink (XDList *list, XDLItem *item) |
| Unlinks an item from a list. | |
| XDLItem * | xdasd_list_link_head (XDList *list, XDLItem *item) |
| Links an item into a list. | |
| XDLItem * | xdasd_list_link_tail (XDList *list, XDLItem *item) |
| Links an item to the tail of a list. | |
Definition in file xdasd_list.h.
1.5.6