list.h

linked list linked list tree struc

/*
 * Wei Cui
 * 981503
 * wec924 
 * Brian Gale
 * bmg002
 * 303473
 */

#define LISTLEN 100
#define NODELEN 10000

typedef struct NODE {
      struct NODE *prev_node;       /*ptr to the prev node */
      struct NODE *next_node; 	    /*ptr to the next node */
      void *item;                   /*ptr to the content of the node */
      int nodeindex;                /*node index in the node array */
}NODE;


typedef struct LIST {
      struct NODE *first_node;      /*ptr to the first node of list */
      struct NODE *current_node;    /*ptr to the current node of list */
      struct NODE *last_node;       /*ptr to the last node of list */
      int counter;                  /*integer to store the lenth of list */
      int listindex;                /*list index in the list array */
}LIST;

LIST *listArrayPtr[LISTLEN];        /*pointer array point to the array that has been defined for storing lists */
NODE *nodeArrayPtr[NODELEN];        /*pointer array point to the array that has been defined for storing nodes */


/* list_adders.c */

LIST *ListCreate();

int ListAdd(LIST *, void *);
int ListInsert(LIST *, void *);
int ListAppend(LIST *, void *);
int ListPrepend(LIST *, void *);

void ListConcat(LIST *, LIST *);


/* list_movers.c */

void *ListCurr(LIST *);

int ListCount(LIST *);

void *ListFirst(LIST *);
void *ListLast(LIST *);
void *ListNext(LIST *);
void *ListPrev(LIST *);

void *ListSearch(LIST *, int (void *, void*), void *);


/* list_removers.c */

void *ListRemove(LIST *);

void ListFree(LIST *, void (void *));

void *ListTrim(LIST *);