38 for (
size_t i = np; i != 0; --i) {
51 for (
size_t i = 0; i <
LIST_SIZE(list); ++i) {
67 for (
size_t i = 0; i <
LIST_SIZE(l2); ++i) {
80void printNodelist(nodelist_t * list)
82 for (
size_t i = 0; i <
LIST_SIZE(list); ++i) {
char * agnameof(void *)
returns a string descriptor for the object.
type-generic dynamically expanding list
#define LIST_AT(list, index)
#define LIST_POP_FRONT(list)
#define LIST_APPEND(list, item)
#define LIST_SET(list, index, item)
#define LIST_PUSH_BACK(list, item)
#define LIST_REVERSE(list)
#define LIST_REMOVE(list, item)
#define LIST_GET(list, index)
#define neighbor(t, i, edim, elist)
void realignNodelist(nodelist_t *list, size_t np)
Make np new front of list, with current last hooked to current first.
void insertNodelist(nodelist_t *list, Agnode_t *cn, Agnode_t *neighbor, int pos)
void reverseAppend(nodelist_t *l1, nodelist_t *l2)
Create l1 @ (rev l2) Destroys and frees l2.
void appendNodelist(nodelist_t *list, size_t one, Agnode_t *n)
Add node after one.
static void concatNodelist(nodelist_t *l1, nodelist_t *l2)
attach l2 to l1.