(#8) C implementation

.gitignore

@@ -0,0 +1,4 @@
+.vscode
+mini_ml
+build
+future

c_implementation/Makefile

@@ -0,0 +1,7 @@
+all: mini_ml
+mini_ml:
+	gcc -Wall -fsanitize=address,undefined -o mini_ml *.c -lm -lcsfml-graphics -lcsfml-system -lcsfml-window
+.PHONY:
+	clean all
+clean:
+	rm mini_ml

c_implementation/README.md

@@ -0,0 +1,13 @@
+# mini_ml
+
+## C implementation
+
+Pros:
+- [ ] Fast execution
+- [ ] Relies on CSFML library
+- [ ] Hackable code
+- [ ] Suitable for big data models
+
+Cons:
+- [ ] Steep learning curve
+- [ ] Limited features

c_implementation/avl.c

@@ -0,0 +1,77 @@
+#include "avl.h"
+#include "avl_impl.h"
+#include <string.h>
+
+DataQueryKeyAvlNode *avl_insert(DataQueryKeyAvlNode *tree_root,
+                                DataQueryKey elem,
+                                DataQueryKeyAvlNode *allocMem,
+                                int (*comp)(const void *, const void *)) {
+  DataQueryKeyAvlNode fakeNode;
+  memset(&fakeNode, 0, sizeof(DataQueryKeyAvlNode));
+  fakeNode.value = elem;
+  return avl_insert_impl(
+      tree_root, &fakeNode, allocMem, sizeof(DataQueryKeyAvlNode), comp,
+      offsetof(DataQueryKeyAvlNode, left), offsetof(DataQueryKeyAvlNode, right),
+      offsetof(DataQueryKeyAvlNode, ht));
+}
+
+DataQueryKeyAvlNode *avl_delete_value(DataQueryKeyAvlNode *tree_root,
+                                      DataQueryKey valueElem,
+                                      int (*comp)(const void *, const void *)) {
+  DataQueryKeyAvlNode fakeNode;
+  memset(&fakeNode, 0, sizeof(DataQueryKeyAvlNode));
+  fakeNode.value = valueElem;
+  return avl_erase_by_value_impl(
+      tree_root, &fakeNode, sizeof(DataQueryKeyAvlNode), comp,
+      offsetof(DataQueryKeyAvlNode, left), offsetof(DataQueryKeyAvlNode, right),
+      offsetof(DataQueryKeyAvlNode, ht));
+}
+
+DataQueryKeyAvlNode *avl_find(DataQueryKeyAvlNode *tree_root,
+                              DataQueryKey valueElem,
+                              int (*comp)(const void *, const void *)) {
+  DataQueryKeyAvlNode fakeNode;
+  memset(&fakeNode, 0, sizeof(DataQueryKeyAvlNode));
+  fakeNode.value = valueElem;
+  return avl_find_impl(tree_root, comp, &fakeNode,
+                       offsetof(DataQueryKeyAvlNode, left),
+                       offsetof(DataQueryKeyAvlNode, right));
+}
+
+DataQueryKeyAvlNode2 *avl_insert2(DataQueryKeyAvlNode2 *tree_root,
+                                  DataQueryKey elem,
+                                  DataQueryKeyAvlNode2 *allocMem,
+                                  int (*comp)(const void *, const void *)) {
+  DataQueryKeyAvlNode2 fakeNode;
+  memset(&fakeNode, 0, sizeof(DataQueryKeyAvlNode2));
+  fakeNode.value = elem;
+  return avl_insert_impl(tree_root, &fakeNode, allocMem,
+                         sizeof(DataQueryKeyAvlNode2), comp,
+                         offsetof(DataQueryKeyAvlNode2, left),
+                         offsetof(DataQueryKeyAvlNode2, right),
+                         offsetof(DataQueryKeyAvlNode2, ht));
+}
+
+DataQueryKeyAvlNode2 *
+avl_delete_value2(DataQueryKeyAvlNode2 *tree_root, DataQueryKey elem,
+                  int (*comp)(const void *, const void *)) {
+  DataQueryKeyAvlNode2 fakeNode;
+  memset(&fakeNode, 0, sizeof(DataQueryKeyAvlNode2));
+  fakeNode.value = elem;
+  return avl_erase_by_value_impl(tree_root, &fakeNode,
+                                 sizeof(DataQueryKeyAvlNode2), comp,
+                                 offsetof(DataQueryKeyAvlNode2, left),
+                                 offsetof(DataQueryKeyAvlNode2, right),
+                                 offsetof(DataQueryKeyAvlNode2, ht));
+}
+
+DataQueryKeyAvlNode2 *avl_find2(DataQueryKeyAvlNode2 *tree_root,
+                                DataQueryKey elem,
+                                int (*comp)(const void *, const void *)) {
+  DataQueryKeyAvlNode2 fakeNode;
+  memset(&fakeNode, 0, sizeof(DataQueryKeyAvlNode2));
+  fakeNode.value = elem;
+  return avl_find_impl(tree_root, comp, &fakeNode,
+                       offsetof(DataQueryKeyAvlNode2, left),
+                       offsetof(DataQueryKeyAvlNode2, right));
+}

c_implementation/avl.h

@@ -0,0 +1,60 @@
+#ifndef AVL_H
+#define AVL_H
+#include "data_query.h"
+#include <stddef.h>
+#include <stdint.h>
+
+/* Preparing AVL trees for each type */
+
+/* AVL of data query keys */
+typedef struct DataQueryKeyAvlNode_ {
+  DataQueryKey value;
+  size_t nr;
+  struct DataQueryKeyAvlNode_ *parent_optional;
+
+  struct DataQueryKeyAvlNode_ *left;
+  struct DataQueryKeyAvlNode_ *right;
+  size_t ht;
+
+} DataQueryKeyAvlNode;
+
+/* AVL of AVLs */
+typedef struct DataQueryKeyAvlNode2_ {
+  DataQueryKey value;
+  DataQueryKeyAvlNode *subavl;
+  size_t nr;
+  struct DataQueryKeyAvlNode2_ *parent_optional;
+
+  struct DataQueryKeyAvlNode2_ *left;
+  struct DataQueryKeyAvlNode2_ *right;
+  size_t ht;
+
+} DataQueryKeyAvlNode2;
+
+DataQueryKeyAvlNode *avl_insert(DataQueryKeyAvlNode *tree_root,
+                                DataQueryKey elem,
+                                DataQueryKeyAvlNode *allocMem,
+                                int (*comp)(const void *, const void *));
+
+DataQueryKeyAvlNode *avl_delete_value(DataQueryKeyAvlNode *tree_root,
+                                      DataQueryKey valueElem,
+                                      int (*comp)(const void *, const void *));
+
+DataQueryKeyAvlNode *avl_find(DataQueryKeyAvlNode *tree_root,
+                              DataQueryKey valueElem,
+                              int (*comp)(const void *, const void *));
+
+DataQueryKeyAvlNode2 *avl_insert2(DataQueryKeyAvlNode2 *tree_root,
+                                  DataQueryKey elem,
+                                  DataQueryKeyAvlNode2 *allocMem,
+                                  int (*comp)(const void *, const void *));
+
+DataQueryKeyAvlNode2 *
+avl_delete_value2(DataQueryKeyAvlNode2 *tree_root, DataQueryKey elem,
+                  int (*comp)(const void *, const void *));
+
+DataQueryKeyAvlNode2 *avl_find2(DataQueryKeyAvlNode2 *tree_root,
+                                DataQueryKey elem,
+                                int (*comp)(const void *, const void *));
+
+#endif