proof of concept planner
This commit is contained in:
1 parent
6c91fb7d60
commit
7c16f20bc2
5 files changed
+149
-26
No files matched your search
+7
-2
@@ -7,11 +7,11 @@ typedef struct llist {
|
||||
struct llist *next;
|
||||
struct llist *prev;
|
||||
struct llist *tail;
|
||||
int (*cmpFn)(void *a, void *b); // function that compares data
|
||||
int (*cmpFn)(const void *a, const void *b); // function that compares data
|
||||
} llist;
|
||||
|
||||
// create new linked list with content(void* data) and cmpFN
|
||||
llist *llistNew(void *data, int (*cmpFN)(void *a, void *b));
|
||||
llist *llistNew(void *data, int (*cmpFN)(const void *a, const void *b));
|
||||
// create new node with data and append to tail of head
|
||||
llist *llistAppend(llist *head, void *data);
|
||||
// return llistNode that contains key or NULL
|
||||
@@ -20,5 +20,10 @@ llist *llistGet(llist *head, void *key);
|
||||
bool llistContains(llist *head, void *key);
|
||||
// free llist node (Does Not free data it contains!!)
|
||||
void llistFree(llist *head);
|
||||
// count llistLen
|
||||
int llistLen(llist *head);
|
||||
|
||||
void llistPrintT(llist *head);
|
||||
void llistPrintH(llist *head);
|
||||
|
||||
#endif
|
||||
Reference in new issue
Block a user