forked from rubinius/rubinius
-
Notifications
You must be signed in to change notification settings - Fork 1
/
linkedlist.hpp
105 lines (80 loc) · 1.46 KB
/
linkedlist.hpp
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
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
#ifndef RBX_LINKEDLIST_HPP
#define RBX_LINKEDLIST_HPP
#include <stdio.h>
#include <assert.h>
class LinkedList {
public:
class Node {
private:
Node* next_;
Node* prev_;
public:
Node();
Node* next() {
return next_;
}
Node* prev() {
return prev_;
}
void set_next(Node* n) {
next_ = n;
}
void set_prev(Node* n) {
prev_ = n;
}
void remove_linkage() {
if(next_) {
assert(next_->prev() == this);
next_->set_prev(prev_);
}
if(prev_) {
assert(prev_->next() == this);
prev_->set_next(next_);
}
next_ = NULL;
prev_ = NULL;
}
};
private:
Node* head_;
size_t count_;
public:
LinkedList();
Node* head() {
return head_;
}
size_t size();
void add(Node*);
void remove(Node*);
// Utility templates
template <typename Roots, typename Root>
class Iterator {
Roots& roots_;
Root* current_;
public:
Iterator(Roots& roots)
: roots_(roots)
, current_(roots.front())
{}
bool more() {
return current_ != 0;
}
void advance() {
current_ = static_cast<Root*>(current_->next());
}
Root* operator->() {
return current_;
}
Root* current() {
return current_;
}
Root* next() {
Root* ret = current_;
if(current_) {
current_ = static_cast<Root*>(current_->next());
}
return ret;
}
};
};
#endif