-
Notifications
You must be signed in to change notification settings - Fork 0
/
linkedlist.h
39 lines (31 loc) · 1.11 KB
/
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
34
35
36
37
38
39
#pragma once
typedef struct LinkedListNodeTag LinkedListNode;
struct LinkedListNodeTag {
void* data;
LinkedListNode* pBefore;
LinkedListNode* pAfter;
};
typedef struct LinkedListTag {
LinkedListNode* pHead;
LinkedListNode* pTail;
int length;
int dataCanBeFreed;
} LinkedList;
typedef struct LinkedListFindResultTag {
LinkedListNode* pNode;
int index;
} LinkedListFindResult;
typedef void* (*llDataFunc)(LinkedListNode* node);
LinkedList* newList();
LinkedListNode* addAtHead(LinkedList* pList, void* data);
LinkedListNode* addAtTail(LinkedList* pList, void* data);
LinkedListNode* addAtIndex(LinkedList* pList, void* data, int index);
void removeAtHead(LinkedList* pList);
void removeAtTail(LinkedList* pList);
void removeAtIndex(LinkedList* pList, int index);
// No head and tail methods provided. Access them via the LinkedList
// struct itself.
LinkedListNode* get(LinkedList* pList, int index);
LinkedListFindResult find(LinkedList* pList, void* matchData, llDataFunc dataFunc);
int contains(LinkedList* pList, void* matchData, llDataFunc dataFunc);
void freeList(LinkedList* pList);