schurtisimon
/
StudyPlanner
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

modified: src/llist.c 

modified:   src/llist.h
sql
simon 2024-12-11 11:01:37 +01:00
parent 9b98291c1e
commit ca5065d569
2 changed files with 7 additions and 3 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

8
src/llist.c
View File

@ -26,7 +26,7 @@ llist *llistTail(llist *l) {
return tail; return tail;
} }
/* creates new node from data and appends it to head /* creates new node from data and appends it to tail
* *
*/ */
llist *llistAppend(llist *head, void *data) { llist *llistAppend(llist *head, void *data) {
@ -41,7 +41,10 @@ llist *llistAppend(llist *head, void *data) {
return new; return new;
} }
void *llistGet(llist *head, void *key) { /*
* return Node containing key or NULL
*/
llist *llistGet(llist *head, void *key) {
llist *c = head; llist *c = head;
while (c != NULL) { while (c != NULL) {
if (key == c) { if (key == c) {
@ -51,6 +54,7 @@ void *llistGet(llist *head, void *key) {
} }
return NULL; return NULL;
} }
bool llistContains(llist *head, void *key) { bool llistContains(llist *head, void *key) {
return llistGet(head, key) != NULL; return llistGet(head, key) != NULL;
} }

2
src/llist.h
View File

@ -14,7 +14,7 @@ llist *llistNew(void *data, int (*cmpFN)(void *a, void *b));
// create new node with data and append to tail of head // create new node with data and append to tail of head
llist *llistAppend(llist *head, void *data); llist *llistAppend(llist *head, void *data);
// return llistNode that contains key or NULL // return llistNode that contains key or NULL
void *llistGet(llist *head, void *key); llist *llistGet(llist *head, void *key);
// TURE if llist contains key // TURE if llist contains key
bool llistContains(llist *head, void *key); bool llistContains(llist *head, void *key);
// free llist node (Does Not free data it contains!!) // free llist node (Does Not free data it contains!!)