Dynamitos/Seele
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

Implementing ECS SystemBase and updating slang

Browse Source
This commit is contained in:
Dynamitos
2022-11-15 12:19:11 +01:00
parent 05bc31a2b4
commit f635ee2100
106 changed files with 1083 additions and 1675 deletions
Download Patch File Download Diff File Expand all files Collapse all files
src/Engine/Containers/Array.h
+10
View File
@@ -679,6 +679,16 @@ public:
beginIt = iterator(_data);
endIt = iterator(_data + N);
}
StaticArray(std::initializer_list<T> init)
{
assert(init.size() == N);
auto beg = init.begin();
for (int i = 0; i < N; ++i)
{
_data[i] = *beg;
beg++;
}
}
~StaticArray()
{
}
src/Engine/Containers/Map.h
+18 -18
View File
@@ -40,8 +40,8 @@ private:
size_t rightChild;
Pair<K, V> pair;
Node()
: leftChild(-1)
, rightChild(-1)
: leftChild(SIZE_MAX)
, rightChild(SIZE_MAX)
, pair()
{
}
@@ -50,8 +50,8 @@ private:
Node& operator=(const Node& other) = default;
Node& operator=(Node&& other) = default;
Node(K key)
: leftChild(-1)
, rightChild(-1)
: leftChild(SIZE_MAX)
, rightChild(SIZE_MAX)
, pair(std::move(key))
{
}
@@ -71,7 +71,7 @@ public:
using reference = PairType&;
using pointer = PairType*;
IteratorBase(size_t x = -1)
IteratorBase(size_t x = SIZE_MAX)
: node(x)
{
}
@@ -199,9 +199,9 @@ public:
using const_reverse_iterator = std::reverse_iterator<const_iterator>;
constexpr Map() noexcept
: root(-1)
, beginIt(-1)
, endIt(-1)
: root(SIZE_MAX)
, beginIt(SIZE_MAX)
, endIt(SIZE_MAX)
, iteratorsDirty(true)
, _size(0)
, comp(Compare())
@@ -209,9 +209,9 @@ public:
}
constexpr explicit Map(const Compare& comp, const Allocator& alloc = Allocator()) noexcept(noexcept(Allocator()))
: nodeContainer(alloc)
, root(-1)
, beginIt(-1)
, endIt(-1)
, root(SIZE_MAX)
, beginIt(SIZE_MAX)
, endIt(SIZE_MAX)
, iteratorsDirty(true)
, _size(0)
, comp(comp)
@@ -219,9 +219,9 @@ public:
}
constexpr explicit Map(const Allocator& alloc) noexcept(noexcept(Compare))
: nodeContainer(alloc)
, root(-1)
, beginIt(-1)
, endIt(-1)
, root(SIZE_MAX)
, beginIt(SIZE_MAX)
, endIt(SIZE_MAX)
, iteratorsDirty(true)
, _size(0)
, comp(Compare())
@@ -335,7 +335,7 @@ public:
constexpr void clear()
{
nodeContainer.clear();
root = -1;
root = SIZE_MAX;
_size = 0;
markIteratorsDirty();
}
@@ -510,13 +510,13 @@ private:
{
newNode->rightChild = r;
newNode->leftChild = node->leftChild;
node->leftChild = -1;
node->leftChild = SIZE_MAX;
}
else
{
newNode->leftChild = r;
newNode->rightChild = node->rightChild;
node->rightChild = -1;
node->rightChild = SIZE_MAX;
}
return nodeContainer.size() - 1;
}
@@ -525,7 +525,7 @@ private:
{
size_t temp;
if (!isValid(r))
return -1;
return SIZE_MAX;
r = splay(r, key);
Node* node = getNode(r);