1 files changed, 68 insertions, 0 deletions

diff --git a/src/kernel/memory/ordered_array.c b/src/kernel/memory/ordered_array.c
new file mode 100644
index 0000000..5d94491
--- /dev/null
+++ b/src/kernel/memory/ordered_array.c
@@ -0,0 +1,68 @@
+#include <kernel/memory/ordered_array.h>
+#include <stdint.h>
+#include <kernel/lib/lib.h>
+#include <kernel/system.h>
+#include "kheap.h"
+
+int8_t standard_lessthan_predicate(type_t a, type_t b)
+{
+    return (int8_t) ((a < b) ? 1 : 0);
+}
+
+ordered_array_t create_ordered_array(uint32_t max_size, lessthan_predicate_t less_than)
+{
+    ordered_array_t to_ret;
+    to_ret.array = (void *) kmalloc(max_size * sizeof(type_t));
+    memset(to_ret.array, 0, max_size * sizeof(type_t));
+    to_ret.size = 0;
+    to_ret.max_size = max_size;
+    to_ret.less_than = less_than;
+    return to_ret;
+}
+
+ordered_array_t place_ordered_array(void *addr, uint32_t max_size, lessthan_predicate_t less_than)
+{
+    ordered_array_t to_ret;
+    to_ret.array = (type_t *) addr;
+    memset(to_ret.array, 0, max_size * sizeof(type_t));
+    to_ret.size = 0;
+    to_ret.max_size = max_size;
+    to_ret.less_than = less_than;
+    return to_ret;
+}
+
+void insert_ordered_array(type_t item, ordered_array_t *array)
+{
+    assert((int) array->less_than);
+    uint32_t iterator = 0;
+    while (iterator < array->size && array->less_than(array->array[iterator], item))
+        iterator++;
+    if (iterator == array->size)
+        array->array[array->size++] = item;
+    else {
+        type_t tmp = array->array[iterator];
+        array->array[iterator] = item;
+        while (iterator < array->size) {
+            iterator++;
+            type_t tmp2 = array->array[iterator];
+            array->array[iterator] = tmp;
+            tmp = tmp2;
+        }
+        array->size++;
+    }
+}
+
+type_t lookup_ordered_array(uint32_t i, ordered_array_t *array)
+{
+    assert(i < array->size);
+    return array->array[i];
+}
+
+void remove_ordered_array(uint32_t i, ordered_array_t *array)
+{
+    while (i < array->size) {
+        array->array[i] = array->array[i + 1];
+        i++;
+    }
+    array->size--;
+}
\ No newline at end of file