-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathLinkedList.h
33 lines (26 loc) · 1010 Bytes
/
LinkedList.h
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
// Data structs for a list of ints
struct ListNode {
void * value;
struct ListNode * next;
};
typedef struct ListNode ListNode;
struct LinkedList {
ListNode * head;
};
typedef struct LinkedList LinkedList;
void llist_init(LinkedList * list);
void llist_print(LinkedList * list);
void llist_add(LinkedList * list, void * value);
int llist_exists(LinkedList * list, void * value);
int llist_remove(LinkedList * list, void * value);
int llist_get_ith(LinkedList * list, int ith, void **value);
int llist_remove_ith(LinkedList * list, int ith);
int llist_number_elements(LinkedList * list);
int llist_save(LinkedList * list, char * file_name);
int llist_read(LinkedList * list, char * file_name);
void llist_sort(LinkedList * list, int ascending);
void llist_clear(LinkedList *list);
int llist_remove_first(LinkedList * list, int * value);
int llist_remove_last(LinkedList * list, int * value);
void llist_insert_first(LinkedList * list, int value);
void llist_insert_last(LinkedList * list, int value);