-
Notifications
You must be signed in to change notification settings - Fork 0
/
Bag.h
271 lines (261 loc) · 6.99 KB
/
Bag.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
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
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
//
// Created by Ryan.Zurrin001 on 1/13/2022.
//
#ifndef GRAPH_CPP_BAG_H
#define GRAPH_CPP_BAG_H
#include <bits/stdc++.h>
using namespace std;
template<typename ITEM>
class Node {
public:
ITEM item;
Node<ITEM> *next;
Node(ITEM item_) {
this->item = item_;
this->next = nullptr;
}
};
template <typename ITEM>
class Bag {
Node<ITEM> *first; // first node in the bag
int n; // number of items in the bag
public:
//using ValueType = ITEM;
Bag() {
first = nullptr;
n = 0;
}
~Bag() {
Node<ITEM> *tmp;
while (first != nullptr) {
tmp = first;
first = first->next;
delete tmp;
}
}
bool isEmpty() const {
return first == nullptr;
}
int size() const {
return n;
}
void add(const ITEM &item) {
Node<ITEM> *oldFirst = first;
first = new Node<ITEM>(item);
first->item = item;
first->next = oldFirst;
n++;
}
bool contains(const ITEM &item) const {
Node<ITEM> *current = first;
while (current != nullptr) {
if (current->item == item) {
return true;
}
current = current->next;
}
return false;
}
void remove(const ITEM &item) {
Node<ITEM> *current = first;
Node<ITEM> *previous = nullptr;
while (current != nullptr) {
if (current->item == item) {
if (previous == nullptr) {
first = current->next;
} else {
previous->next = current->next;
}
delete current;
n--;
return;
}
previous = current;
current = current->next;
}
}
void clear() {
Node<ITEM> *tmp;
while (first != nullptr) {
tmp = first;
first = first->next;
delete tmp;
}
n = 0;
}
void print() const {
Node<ITEM> *current = first;
while (current != nullptr) {
std::cout << current->item << " ";
current = current->next;
}
std::cout << std::endl;
}
// add an iterator to the bag
class Iterator {
public:
Iterator(Node<ITEM> *current) {
this->current = current;
}
Iterator(const Iterator &other) {
this->current = other.current;
}
Iterator &operator=(const Iterator &other) {
this->current = other.current;
return *this;
}
Iterator &operator++() {
this->current = this->current->next;
return *this;
}
Iterator operator++(int) {
Iterator tmp(*this);
++(*this);
return tmp;
}
bool operator==(const Iterator &other) const {
return this->current == other.current;
}
bool operator!=(const Iterator &other) const {
return this->current != other.current;
}
ITEM &operator*() {
return this->current->item;
}
ITEM *operator->() {
return &(this->current->item);
}
private:
Node<ITEM> *current;
};
Iterator begin() {
return Iterator(first);
}
Iterator end() {
return Iterator(nullptr);
}
// overload the [] operator
ITEM &operator[](int index) {
Node<ITEM> *current = first;
for (int i = 0; i < index; i++) {
current = current->next;
}
// make sure the index is valid
if (current == nullptr) {
throw std::out_of_range("Index out of range");
}
return current->item;
}
// overload the () operator
ITEM &operator()(int index) {
Node<ITEM> *current = first;
for (int i = 0; i < index; i++) {
current = current->next;
}
// make sure the index is valid
if (current == nullptr) {
throw std::out_of_range("Index out of range");
}
return current->item;
}
// over load the operator <<
friend ostream &operator<<(ostream &os, Bag<ITEM> &bag) {
for (auto it = bag.begin(); it != bag.end(); ++it) {
os << *it << " ";
}
return os;
}
// over load the relational operators
bool operator==(const Bag<ITEM> &other) const {
if (this->n != other.n) {
return false;
}
Node<ITEM> *current = this->first;
Node<ITEM> *otherCurrent = other.first;
while (current != nullptr) {
if (current->item != otherCurrent->item) {
return false;
}
current = current->next;
otherCurrent = otherCurrent->next;
}
return true;
}
bool operator!=(const Bag<ITEM> &other) const {
return !(*this == other);
}
bool operator<(const Bag<ITEM> &other) const {
if (this->n < other.n) {
return true;
}
if (this->n > other.n) {
return false;
}
Node<ITEM> *current = this->first;
Node<ITEM> *otherCurrent = other.first;
while (current != nullptr) {
if (current->item < otherCurrent->item) {
return true;
}
if (current->item > otherCurrent->item) {
return false;
}
current = current->next;
otherCurrent = otherCurrent->next;
}
return false;
}
bool operator>(const Bag<ITEM> &other) const {
return other < *this;
}
bool operator<=(const Bag<ITEM> &other) const {
return !(other < *this);
}
bool operator>=(const Bag<ITEM> &other) const {
return !(*this < other);
}
ITEM get(int i) {
Node<ITEM> *current = first;
for (int j = 0; j < i; j++) {
current = current->next;
}
return current->item;
}
ITEM pickRandom() {
if (n == 0) {
throw std::out_of_range("Empty bag");
}
srand(time(NULL));
int randomIndex = rand() % n;
Node<ITEM> *current = first;
for (int i = 0; i < randomIndex; i++) {
current = current->next;
}
return current->item;
}
ITEM removeRandom() {
if (n == 0) {
throw std::out_of_range("Empty bag");
}
srand(time(NULL));
int randomIndex = rand() % n;
Node<ITEM> *current = first;
for (int i = 0; i < randomIndex; i++) {
current = current->next;
}
ITEM item = current->item;
if (current == first) {
first = first->next;
} else {
Node<ITEM> *previous = first;
while (previous->next != current) {
previous = previous->next;
}
previous->next = current->next;
}
delete current;
n--;
return item;
}
};
#endif //GRAPH_CPP_BAG_H