/** * @file LinkedList.h * @author Davidthefat * @date 10/27/12 * @version 1.0 */ #include #include #ifndef LINKEDLIST_H #define LINKEDLIST_H typedef struct node { void *data; struct node *next; } Node; typedef struct LinkedList { Node *head, *tail, *iterator; int size; void *(*get)(int index); void (*add)(void *in, int index); void (*addEnd)(void *in); void (*addBeg)(void *in); void (*addN)(void*in, int index); char (*del)(int index); void (*set)(void *in, int index); void (*destruct)(void); } LList; LList *self; LList *construct(); void *get(int index); void add(void *in, int index); void addEnd(void *in); void addBeg(void *in); char del(int index); void set(void *in, int index); void destruct(); #endif