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
|
/* -------------------------------------------
Copyright (C) 2024, Amlal EL Mahrouss, all rights reserved.
------------------------------------------- */
#pragma once
#include <CompilerKit/CompilerKit.h>
#include <NewKit/Array.h>
#include <NewKit/Defines.h>
#define TRY_FIND_NODE(NAME, NODE) \
auto* NAME = NODE; \
while (NAME) \
{ \
if (NAME->fIndex == Index) \
return NAME->fVal; \
NAME = NAME->fNext; \
}
#define TRY_FIND_NODE2(NAME, NODE) \
auto* NAME = NODE; \
while (NAME) \
{ \
if (NAME->fIndex == Index) \
return Ref<T>{NAME->fVal}; \
NAME = NAME->fNext; \
}
#define TRY_REMOVE_NODE(NODE) \
if (NODE && NODE->fIndex == Index) \
{ \
NODE->fUsed = false; \
NODE->fIndex = 0; \
\
return true; \
}
// FIXME: this is a shitty algorithm, which is consumer hungry.
// Remove and occurences of that, and remove that class.
namespace Kernel
{
template <typename T>
class MutableArray;
template <typename T, T _PlaceHolderValue>
class NullableMutableArray;
template <typename T>
class MutableLinkedList
{
public:
T fVal;
SizeT fIndex{0};
Boolean fUsed{false};
MutableLinkedList* fPrev{nullptr};
MutableLinkedList* fNext{nullptr};
};
template <typename T, T _PlaceHolderValue>
class NullableMutableArray
{
public:
// explicit this.
explicit NullableMutableArray()
: fFirstNode(new MutableLinkedList<T>())
{
}
/*
* We free all the nodes allocated by the array
* and store the next one inside "NextIt"
*/
virtual ~NullableMutableArray()
{
auto* It = fFirstNode;
MutableLinkedList<T>* NextIt = nullptr;
while (It)
{
NextIt = It->fNext;
delete It;
It = NextIt;
}
}
NullableMutableArray& operator=(const NullableMutableArray&) = default;
NullableMutableArray(const NullableMutableArray&) = default;
operator bool()
{
return Count() > 1;
}
public:
T operator[](const SizeT& Index) const
{
TRY_FIND_NODE(first, fFirstNode);
TRY_FIND_NODE(last, fLastNode);
return _PlaceHolderValue;
}
SizeT Count() const
{
return fNodeCount;
}
public:
Boolean Remove(const SizeT& Index)
{
TRY_REMOVE_NODE(fFirstNode);
TRY_REMOVE_NODE(fLastNode);
return false;
}
Boolean Add(const T val)
{
auto* iterationNode = fFirstNode;
MUST_PASS(iterationNode);
while (iterationNode)
{
if (!iterationNode->fUsed)
{
iterationNode->fVal = val;
iterationNode->fIndex = 0;
iterationNode->fUsed = true;
++fNodeCount;
return true;
}
iterationNode = iterationNode->fNext;
}
return false;
}
private:
/* Avoid useless lookups */
MutableLinkedList<T>* fLastNode{nullptr};
MutableLinkedList<T>* fFirstNode{nullptr};
/* Number of nodes inside of this dynamic array. */
Kernel::SizeT fNodeCount{0};
private:
// don't remove that
friend MutableArray<T>;
};
template <typename T>
class MutableArray : public NullableMutableArray<voidPtr, nullptr>
{
public:
// explicit this.
explicit MutableArray() = default;
virtual ~MutableArray() = default;
ZKA_COPY_DEFAULT(MutableArray)
public:
Boolean Add(const T val)
{
auto* iterationNode = fFirstNode;
if (!iterationNode)
{
fFirstNode = new MutableLinkedList<T>();
iterationNode = fFirstNode;
}
MUST_PASS(iterationNode);
while (iterationNode)
{
if (!iterationNode->fUsed)
{
iterationNode->fVal = val;
iterationNode->fIndex = 0;
iterationNode->fUsed = true;
++fNodeCount;
return true;
}
iterationNode = iterationNode->fNext;
}
return false;
}
public:
Ref<T> operator[](const SizeT& Index) const
{
TRY_FIND_NODE2(first, fFirstNode);
TRY_FIND_NODE2(last, fLastNode);
return {};
}
SizeT Count() const
{
return fNodeCount;
}
bool Contains(T& value) noexcept
{
MutableLinkedList<T>* first = fFirstNode;
while (first)
{
if (first->fVal == value && first->fUsed)
return true;
first = first->fNext;
}
return false;
}
private:
/* Avoid useless lookups */
MutableLinkedList<T>* fLastNode{nullptr};
MutableLinkedList<T>* fFirstNode{nullptr};
/* Number of nodes inside of this dynamic array. */
Kernel::SizeT fNodeCount{0};
};
} // namespace Kernel
|
