-
Notifications
You must be signed in to change notification settings - Fork 8
/
list.h
79 lines (67 loc) · 1.03 KB
/
list.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
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
67
68
69
70
71
72
73
74
75
76
77
78
79
#ifndef __SELF_DEFINE_LIST__
#define __SELF_DEFINE_LIST__
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <string>
// not thread safe
template<typename E>
class List
{
protected:
class Node
{
public:
E val;
Node *next;
Node(E x) : val(x), next(NULL) {}
};
public:
List()
: head(0)
{
this->tail = &this->head;
}
List& operator=(List&& move)
{
if (this != &move)
{
this->head.next = move.head.next;
this->tail = move.tail;
move.tail = &move.head;
move.head.next = NULL;
}
return *this;
}
void add_tail(E val)
{
Node *cur = new Node(val);
this->tail->next = cur;
this->tail = cur;
}
bool get_head(E& val)
{
if (this->tail == &this->head)
return false;
Node *cur;
cur = this->head.next;
if (cur->next)
{
this->head.next = cur->next;
} else {
this->head.next = NULL;
this->tail = &this->head;
}
val = cur->val;
delete cur;
return true;
}
bool empty()
{
return (this->tail == &this->head);
}
private:
Node head;
Node *tail;
};
#endif