Modularize

1 files changed, 10 insertions, 218 deletions

diff --git a/src/main.c b/src/main.c
index 8af95d6..1d4f733 100644
--- a/src/main.c
+++ b/src/main.c
@@ -5,235 +5,20 @@
 
 #include <lib/lib.h>
 #include <lib/bool.h>
+#include <lib/monad.h>
 #include <lib/dir.h>
 #include <lib/file.h>
 #include <lib/time.h>
 #include <lib/color.h>
 #include <lib/algo/flood_fill.h>
+#include <lib/algo/avl_tree.h>
 #include <lib/seg/util.h>
+#include <lib/seg/mask_data.h>
 
 #define OFFSET 16
 
 #define N_DILATIONS 3
 
-struct Result {
-  void* data;
-  bool_t success;
-};
-
-struct MaskData {
-  uint16_t label;
-  size_t area;
-  size_t perimeter;
-};
-
-struct MaskData* create_mask_data(uint16_t label) {
-  struct MaskData *data = (struct MaskData*)malloc(sizeof(struct MaskData));
-  data->label = label;
-  data->area = 0;
-  data->perimeter = 0;
-  return data;
-}
-
-struct AVLNode {
-  void* data;
-  bool_t (*compare)(void*, void*);
-  struct AVLNode* left;
-  struct AVLNode* right;
-  uint8_t height;
-};
-
-uint8_t get_height(struct AVLNode* node)
-{
-  if (node == NULL) {
-    return 0;
-  }
-  return node->height;
-}
-
-bool_t compare_labels(struct MaskData* left, struct MaskData* right)
-{
-  return left->label < right->label;
-}
-
-struct AVLNode* create_avl_mask_node(struct MaskData* data)
-{
-  struct AVLNode* node = (struct AVLNode*)malloc(sizeof(struct AVLNode));
-  if (node == NULL) {
-    return NULL;
-  }
-  node->data = data;
-  node->compare = (bool_t (*)(void*,void*))&compare_labels;
-  node->left = NULL;
-  node->right = NULL;
-  node->height = 1; // Leaf initially
-  return node;
-}
-
-uint8_t max_height(uint8_t a, uint8_t b)
-{
-  return (a > b) ? a : b;
-}
-
-ssize_t get_balance_factor(struct AVLNode* node)
-{
-  if (node == NULL) {
-    return 0;
-  }
-  return get_height(node->left) - get_height(node->right);
-}
-
-struct AVLNode* right_rotate(struct AVLNode* parent)
-{
-  struct AVLNode* child1 = parent->left;
-  struct AVLNode* child2 = child1->right;
-
-  child1->right = parent;
-  parent->left = child2;
-
-  parent->height = max_height(get_height(parent->left), get_height(parent->right)) + 1;
-  child1->height = max_height(get_height(child1->left), get_height(child1->right)) + 1;
-  return child1;
-}
-
-struct AVLNode* left_rotate(struct AVLNode* parent)
-{
-  struct AVLNode* child1 = parent->right;
-  struct AVLNode* child2 = child1->left;
-
-  child1->left = parent;
-  parent->right = child2;
-
-  parent->height = max_height(get_height(parent->left), get_height(parent->right)) + 1;
-  child1->height = max_height(get_height(child1->left), get_height(child1->right)) + 1;
-  return child1;
-}
-
-struct Result insert_mask(struct AVLNode* node, struct MaskData* data)
-{
-  struct Result result;
-  // 1. Standard BST insertion
-  if (node == NULL) {
-    return (struct Result) {create_avl_mask_node(data), TRUE};
-  }
-
-  struct MaskData *node_data = (struct MaskData*)node->data;
-  if (node->compare(data, node_data)) {
-    result = insert_mask(node->left, data);
-    if (!result.success) {
-      fprintf(stderr, "Failed to insert!");
-      return result;
-    }
-    node->left = (struct AVLNode*)result.data;
-  } else if (node->compare(node->data, data)) {
-    result = insert_mask(node->right, data);
-    if (!result.success) {
-      fprintf(stderr, "Failed to insert!");
-      return result;
-    }
-    node->right = (struct AVLNode*)result.data;
-  } else {
-    return (struct Result) {node, FALSE};
-  }
-
-  // 2. Update height of the ancestor node
-  node->height = 1 + max_height(get_height(node->left), get_height(node->right));
-
-  ssize_t balance = get_balance_factor(node);
-
-  // 4. If the node becomes unbalanced
-
-  // LeftLeft
-  if ((balance > 1) && node->compare(data, node->left->data)) {
-    return (struct Result) {right_rotate(node), TRUE};
-  }
-  // RightRight
-  if ((balance < -1) && node->compare(node->right->data, data)) {
-    return (struct Result) {left_rotate(node), TRUE};
-  }
-  // LeftRight
-  if ((balance > 1) && node->compare(node->left->data, data)) {
-    return (struct Result) {right_rotate(node), TRUE};
-  }
-  // RightLeft
-  if ((balance < -1) && node->compare(data,node->right->data)) {
-    return (struct Result) {left_rotate(node), TRUE};
-  }
-  return (struct Result) {node, TRUE};
-}
-
-struct AVLNode* insert_mask_alloc(struct AVLNode* node, uint16_t label)
-{
-  struct MaskData* data = create_mask_data(label);
-  struct Result result = insert_mask(node, data);
-  if (!result.success) {
-    free(data);
-  }
-  return (struct AVLNode*)result.data;
-}
-
-void print_label(struct AVLNode* root) {
-  if (root != NULL) {
-    print_label(root->left);
-    struct MaskData* data = root->data;
-    printf("%d: (%zu, %zu) ", data->label, data->area, data->perimeter);
-    print_label(root->right);
-  }
-}
-
-void free_avl_tree(struct AVLNode* root) {
-  if (root != NULL) {
-    free_avl_tree(root->left);
-    free_avl_tree(root->right);
-    free(root);
-  }
-}
-
-void free_avl_tree_nodes(struct AVLNode* root) {
-  if (root != NULL) {
-    free_avl_tree_nodes(root->left);
-    free_avl_tree_nodes(root->right);
-    if (root->data != NULL) {
-      free(root->data);
-    }
-    free(root);
-  }
-}
-
-bool_t increase_label_area(struct AVLNode* root, uint16_t label) {
-  if (root == NULL) {
-    return FALSE;
-  }
-  struct MaskData* data = (struct MaskData*)root->data;
-  if (data->label == label) {
-    data->area++;
-  }
-  else if (data->label > label) {
-    increase_label_area(root->left, label);
-  }
-  else if (data->label < label) {
-    increase_label_area(root->right, label);
-  }
-  return TRUE;
-}
-
-bool_t increase_label_perimeter(struct AVLNode* root, uint16_t label) {
-  if (root == NULL) {
-    return FALSE;
-  }
-  struct MaskData* data = (struct MaskData*)root->data;
-  if (data->label == label) {
-    data->perimeter++;
-  }
-  else if (data->label > label) {
-    increase_label_perimeter(root->left, label);
-  }
-  else if (data->label < label) {
-    increase_label_perimeter(root->right, label);
-  }
-  return TRUE;
-}
-
 int main(int argc, char** argv)
 {
   struct AVLNode* root = NULL;
@@ -296,6 +81,7 @@ int main(int argc, char** argv)
   //free(masks);
   //-----------------------------------------------
 
+#ifdef VISUAL
   //-----------------------------------------------
   //-RAYLIB-INIT
   //-----------------------------------------------
@@ -381,5 +167,11 @@ int main(int argc, char** argv)
     free(masks);
   }
   CloseWindow();
+#else
+  if (masks != NULL) {
+    write_array("../out.bin", masks, width*height*sizeof(uint16_t));
+    free(masks);
+  }
+#endif
   return 0;
 }