blob: f05e0dee18e6194d451c1231a7f89f1f5f81e9b5 (
plain)
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
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
|
#include <assert.h>
namespace omega {
template<class T> List_Iterator<T>::List_Iterator(List<T> &l)
: List_Element_Iterator<T>(l.contents) {}
template<class T> List_Iterator<T>::List_Iterator(const List<T> &l)
: List_Element_Iterator<T>(l.contents) {}
template<class T> List_Iterator<T>::List_Iterator()
: List_Element_Iterator<T>(0) {}
template<class T> Iterator<T> *List<T>::new_iterator()
{
return new List_Iterator<T>(*this);
}
template<class T> const T &List<T>::operator[](int i) const
{
assert(i > 0 && "Subscript out of bounds");
List_Iterator<T> p(*this);
while(--i > 0 && p)
p++;
if (p)
return *p;
else
return *((T *)0);
}
template<class T> T &List<T>::operator[](int i)
{
assert(i > 0 && "Subscript out of bounds");
List_Iterator<T> p(*this);
while(--i > 0 && p)
p++;
if (p)
return *p;
else
return *((T *)0);
}
template<class T> int List<T>::index(const T &item) const
{
List_Iterator<T> p(*this);
int i = 1;
while(p && *p != item)
{
p++;
i++;
}
if (p)
return i;
else
return 0;
}
template<class T> int List<T>::size() const
{
int i = 0;
List_Element<T> * p = contents;
while (p)
{
p = p->tail;
i++;
}
return i;
}
template<class T> T &List<T>::front() const
{
return contents->head;
}
template<class T> T List<T>::remove_front()
{
List_Element<T> *frunt = contents;
contents = contents->tail;
T fruntT = frunt->head;
frunt->tail = 0;
delete frunt;
return fruntT;
}
template<class T> void List<T>::prepend(const T &item)
{
contents = new List_Element<T>(item, contents);
}
template<class T> void List<T>::append(const T &item)
{
*(end()) = new List_Element<T>(item, 0);
}
template<class T> void List<T>::ins_after(List_Iterator<T> i,
const T &item)
{
#if ! defined NDEBUG
for (List_Element<T> *e = contents; e != &(i.element()); e=e->tail)
{
assert(e);
}
#endif
i.element().tail = new List_Element<T>(item, i.element().tail);
}
template<class T> void List<T>::del_front()
{
List_Element<T> *e = contents;
contents = contents->tail;
e->tail = 0;
delete e;
}
template<class T> void List<T>::del_after(List_Iterator<T> i)
{
#if ! defined NDEBUG
for (List_Element<T> *e0 = contents; e0 != &(i.element()); e0=e0->tail)
{
assert(e0);
}
#endif
List_Element<T> *e = i.element().tail;
i.element().tail = e->tail;
e->tail = 0;
delete e;
}
template<class T> void List<T>::clear()
{
delete contents;
contents = 0;
}
template<class T> void List<T>::join(List<T> &consumed)
{
List_Element<T> *e = consumed.contents;
consumed.contents = 0;
*(end()) = e;
}
} // namespace
|
