Merge remote-tracking branch 'Kernel/master'

Kernel/include/hashmap.hpp

@@ -0,0 +1,121 @@
+/*
+	This file is part of Fennix Kernel.
+
+	Fennix Kernel is free software: you can redistribute it and/or
+	modify it under the terms of the GNU General Public License as
+	published by the Free Software Foundation, either version 3 of
+	the License, or (at your option) any later version.
+
+	Fennix Kernel is distributed in the hope that it will be useful,
+	but WITHOUT ANY WARRANTY; without even the implied warranty of
+	MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+	GNU General Public License for more details.
+
+	You should have received a copy of the GNU General Public License
+	along with Fennix Kernel. If not, see <https://www.gnu.org/licenses/>.
+*/
+
+#pragma once
+
+#define HASHMAP_ERROR -0x8A50
+
+template <typename K, typename V>
+class HashNode
+{
+public:
+    V Value;
+    K Key;
+
+    HashNode(K Key, V Value)
+    {
+        this->Value = Value;
+        this->Key = Key;
+    }
+};
+
+template <typename K, typename V>
+class HashMap
+{
+    int HashMapSize;
+    int HashMapCapacity;
+    HashNode<K, V> **Nodes;
+    HashNode<K, V> *DummyNode;
+
+public:
+    HashMap()
+    {
+        HashMapCapacity = 20;
+        HashMapSize = 0;
+        Nodes = new HashNode<K, V> *[HashMapCapacity];
+        for (int i = 0; i < HashMapCapacity; i++)
+            Nodes[i] = nullptr;
+        DummyNode = new HashNode<K, V>(-1, -1);
+    }
+
+    ~HashMap()
+    {
+        for (int i = 0; i < HashMapCapacity; i++)
+            if (Nodes[i] != nullptr)
+                delete Nodes[i], Nodes[i] = nullptr;
+        delete[] Nodes, Nodes = nullptr;
+        delete DummyNode, DummyNode = nullptr;
+    }
+
+    int HashCode(K Key) { return Key % HashMapCapacity; }
+
+    void AddNode(K Key, V Value)
+    {
+        HashNode<K, V> *tmp = new HashNode<K, V>(Key, Value);
+        int Index = HashCode(Key);
+
+        while (Nodes[Index] != nullptr && Nodes[Index]->Key != Key && Nodes[Index]->Key != (K)-1)
+        {
+            Index++;
+            Index %= HashMapCapacity;
+        }
+
+        if (Nodes[Index] == nullptr || Nodes[Index]->Key == (K)-1)
+            HashMapSize++;
+        Nodes[Index] = tmp;
+    }
+
+    V DeleteNode(int Key)
+    {
+        int Index = HashCode(Key);
+
+        while (Nodes[Index] != nullptr)
+        {
+            if (Nodes[Index]->Key == Key)
+            {
+                HashNode<K, V> *tmp = Nodes[Index];
+                Nodes[Index] = DummyNode;
+                HashMapSize--;
+                return tmp->Value;
+            }
+            Index++;
+            Index %= HashMapCapacity;
+        }
+        return HASHMAP_ERROR;
+    }
+
+    V Get(int Key)
+    {
+        int Index = HashCode(Key);
+        int Iterate = 0;
+
+        while (Nodes[Index] != nullptr)
+        {
+            if (Iterate++ > HashMapCapacity)
+                return HASHMAP_ERROR;
+
+            if (Nodes[Index]->Key == (K)Key)
+                return Nodes[Index]->Value;
+            Index++;
+            Index %= HashMapCapacity;
+        }
+        return HASHMAP_ERROR;
+    }
+
+    int Size() { return HashMapSize; }
+    bool IsEmpty() { return HashMapSize == 0; }
+};