-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathSequence.cpp
More file actions
228 lines (208 loc) · 4.77 KB
/
Sequence.cpp
File metadata and controls
228 lines (208 loc) · 4.77 KB
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
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
#include "Sequence.h"
Sequence::Sequence(size_type sz)
{
numElts = sz;
for(int i = 0; i < numElts; i++){
SequenceNode *newNode = new SequenceNode();
if(i <= 0){
head = newNode;
}
else if(i == 1){
head ->next = newNode;
tail = newNode;
tail->prev = head;
}
else{
tail -> next = newNode;
newNode -> prev = tail;
tail = newNode;
}
}
}
Sequence::Sequence(const Sequence& s)
{
numElts = s.numElts;
SequenceNode *placeHolder = s.head;
for(int i = 0; i < numElts; i++){
SequenceNode *newNode = new SequenceNode(placeHolder->elt);
if(i == 0){
head = newNode;
}
else if(i == 1){
tail = newNode;
tail->prev = head;
head->next = tail;
}
else{
tail->next = newNode;
newNode->prev = tail;
tail = newNode;
}
placeHolder = placeHolder->next;
}
}
Sequence::~Sequence()
{
}
Sequence& Sequence::operator=(const Sequence& s)
{
Sequence *newSeq = new Sequence(s.numElts);
SequenceNode *replacement = newSeq->head;
SequenceNode *oldNode = s.head;
for(int i = 0; i < numElts; i++){
replacement = oldNode;
replacement = replacement->next;
if(i == numElts){
newSeq->tail = replacement;
}
delete oldNode;
}
delete &s;
return *newSeq;
}
Sequence::value_type& Sequence::operator[](size_type position)
{
if(position > numElts || position < 0){
throw exception();
}
SequenceNode *placeHolder = head;
for(int i = 0; i < position; i ++){
placeHolder = placeHolder->next;
}
return placeHolder->elt;
}
void Sequence::push_back(const value_type& value)
{
SequenceNode * placeHolder = new SequenceNode(value);
if(tail == NULL){
head = placeHolder;
tail = placeHolder;
}
else{
placeHolder->prev = tail;
tail->next = placeHolder;
tail = placeHolder;
}
numElts++;
}
void Sequence::pop_back()
{
SequenceNode * placeHolder = NULL;
if(numElts > 0){
if(numElts == 1){
delete head;
numElts--;
}
else{
placeHolder = tail->prev;
delete tail;
tail = placeHolder;
tail->next = NULL;
numElts--;
}
}
else{
throw exception();
}
}
void Sequence::insert(size_type position, value_type value)
{
if(position > numElts || position < 0){
throw exception();
}
if(position == numElts){
push_back(value);
}
else if(position == 0){
SequenceNode *tempPtr = new SequenceNode;
tempPtr-> elt = value;
tempPtr-> prev = NULL;
tempPtr-> next = head;
head = tempPtr;
}
else{
SequenceNode *tempPtr = head;
for(int i = 0; i < position; i++){
tempPtr = tempPtr->next;
}
SequenceNode *oldPtr = tempPtr;
oldPtr->next = tempPtr;
tempPtr->prev = oldPtr;
tempPtr->elt = value;
}
numElts++;
}
const Sequence::value_type& Sequence::front() const
{
if(numElts <= 0){
throw exception();
}
return head->elt;
}
const Sequence::value_type& Sequence::back() const
{
if(numElts <= 0){
throw exception();
}
return tail->elt;
}
bool Sequence::empty() const
{
if(numElts == 0){
return true;
}
return false;
}
Sequence::size_type Sequence::size() const
{
return numElts;
}
void Sequence::clear()
{
if(numElts <= 0){
throw exception();
}
SequenceNode * deleteTarget = NULL;
SequenceNode *placeHolder = head;
for(int i = 0; i < numElts; i++){
deleteTarget = placeHolder;
placeHolder = placeHolder->next;
delete deleteTarget;
}
}
void Sequence::erase(size_type position, size_type count)
{
SequenceNode *placeHolder = head;
if(position >= 0 && position + count - 1 <= numElts){
for(int i = 0; i < position+count; i++){
if(i < position){
placeHolder = placeHolder->next;
}
else{
SequenceNode *destructible = placeHolder;
placeHolder = placeHolder->next;
delete destructible;
}
}
}
else{
throw exception();
}
}
string Sequence::toString(){
string rtString = "<";
SequenceNode*placeHolder = head;
for(int i = 0; i < numElts; i++){
rtString += to_string(placeHolder->elt);
rtString += " ";
placeHolder = placeHolder->next;
}
rtString += ">";
return rtString;
}
ostream& operator<<(ostream& os, const Sequence& s)
{
Sequence target = s;
os << " " << target.toString() << endl;
return os;
}