forked from fail46/OHack
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Fail.Containers.List.hpp
189 lines (163 loc) · 3.37 KB
/
Fail.Containers.List.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
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
#pragma once
#include <deque>
#include "Fail.Object.hpp"
namespace Fail
{
// Container classes
namespace Containers
{
template <typename T>
class List : public object
{
public:
// Default constructor
inline List ()
{
return;
}
// Add an object to the back of the list
inline void Add (T Object)
{
this->Deque.push_back(Object);
return;
}
// Add an object to the front of the list
inline void AddBack (T Object)
{
this->Deque.push_front(Object);
return;
}
// Remove the object at the front of the list
inline void RemoveFront ()
{
this->Deque.pop_front();
return;
}
// Remove the object at the back of the list
inline void RemoveBack ()
{
this->Deque.pop_back();
return;
}
// Get and remove the object at the front of the list
T GetAndRemoveFront ()
{
T Object;
memcpy(&Object, &this->Deque.front(), sizeof(T));
this->RemoveFront();
return Object;
}
// Get and remove the object at the back of the list
T GetAndRemoveBack ()
{
T Object;
memcpy(&Object, &this->Deque.back(), sizeof(T));
this->RemoveBack();
return Object;
}
// Find an object in the list and return its position. -1 if not found.
int Find (T& Object)
{
unsigned int i = 0;
while(i < this->Deque.size())
{
if(this->Deque[i] == Object)
{
return i;
}
i++;
}
return -1;
}
// Clear the list
inline void Clear ()
{
this->Deque.clear();
return;
}
// Check if the list is empty
inline bool Empty () const
{
return this->Deque.empty;
}
// Insert an object into the list
inline void Insert (T Object, unsigned int Position)
{
this->Deque.insert(Position, Object);
return;
}
// Swap 2 objects in the list
inline void Swap (unsigned int FirstObject, unsigned int SecondObject)
{
T* Object = new T;
*Object = this->Deque[FirstObject];
this->Deque[FirstObject] = this->Deque[SecondObject];
this->Deque[SecondObject] = *Object;
delete Object;
return;
}
// Get the number of objects in the list
inline unsigned int Size () const
{
return this->Deque.size();
}
// Get the list member at i
T& At (unsigned int i)
{
if(i >= this->Deque.size() || i < 0)
{
throw std::exception("Unable to get List member: Out of range.");
}
return this->Deque[i];
}
// Array access operator
inline T& operator [] (unsigned int i)
{
return this->At(i);
}
// Copy operator
List<T>& operator = (const List<T>& Other)
{
unsigned int i = 0;
while(i < Other.Size())
{
this->At[i] = const_cast<List<T>>(Other)[i];
i++;
}
return *this;
}
// Equality operator
bool operator == (const List<T>& Other)
{
if(this->ObjectSize != Other.ObjectSize)
{
return false;
}
unsigned int i = 0;
while(i < Other.Size())
{
if(this->At(i) != const_cast<List<T>>(Other)[i])
{
return false;
}
i++;
}
return true;
}
// Inequality operator
inline bool operator != (const List<T>& Other)
{
return !this->operator ==(Other);
}
// Add an object to the back of the list
inline void operator += (T Object)
{
this->AddBack(Object);
return;
}
protected:
// Deque object
std::deque<T> Deque;
};
}
}