FilesExpand file tree

master

/

LinkedList.h

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

66 lines (58 loc) · 986 Bytes

master

/

LinkedList.h

Copy path

Top

File metadata and controls

• Code
• Blame

66 lines (58 loc) · 986 Bytes

Raw

Copy raw file

Download raw file

Open symbols panel

Edit and raw actions

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

40

41

42

43

44

45

46

47

48

49

50

51

52

53

54

55

56

57

58

59

60

61

62

63

64

65

66

#ifndef LINKED_LIST_H

#define LINKED_LIST_H

template<typename T>

class LinkedList {

public:

LinkedList():last(NULL),first(NULL),length(0){}

struct Node {

T* item;

Node* next;

Node* prev;

Node(T* item):item(item),next(NULL),prev(NULL){}

};

void Add(T* item) {

Node* n = new Node(item);

if (last == NULL) {

last = n;

first = n;

} else {

last->next = n;

n->prev = last;

last = n;

}

length += 1;

}

Node* GetItem(T* item) {

Node* n = first;

while(n != NULL) {

if (n->item == item)

return n;

n = n->next;

}

return NULL;

}

void Remove(T* item) {

Node* n = GetItem(item);

Remove(n);

}

Node* Remove(Node* n) {

if (!n)

return NULL;

if (first == n)

first = n->next;

if (last == n)

last = n->prev;

if (n->prev)

n->prev->next = n->next;

if (n->next)

n->next->prev = n->prev;

Node* ret = n->next;

delete n;

length -= 1;

return n->next;

}

Node* last;

Node* first;

uint16_t length;

};

#endif