From 3206bfbd39f3e46e84a6188c8665f0183b905867 Mon Sep 17 00:00:00 2001
From: Pagwin <pgp2024@pagwin.xyz>
Date: Fri, 22 Nov 2024 22:07:26 -0500
Subject: [PATCH] removal from the tree is screwed idk if I'm getting this done
 tonight

---
 Map.hpp | 72 ++-------------------------------------------------------
 1 file changed, 2 insertions(+), 70 deletions(-)

diff --git a/Map.hpp b/Map.hpp
index 052da40..0e2604a 100644
--- a/Map.hpp
+++ b/Map.hpp
@@ -661,76 +661,8 @@ private:
     parent->color = Color::Black;
     distant_nephew->color = Color::Black;
   }
-  // heavily referring to
-  // https://en.wikipedia.org/wiki/Red%E2%80%93black_tree#Removal_of_a_black_non-root_leaf
-  void complex_erase(Iterator pos) {
-
-    Node *to_delete = &this->nodes[pos.ref.value()];
-    Node *parent = to_delete->par();
-    assert(parent != nullptr);
-
-    Direction dir =
-        parent->r() == to_delete ? Direction::Right : Direction::Left;
-
-    Node *sibling;
-    ;
-    Node *close_nephew;
-    Node *distant_nephew;
-
-    parent->c_trans(dir, nullptr);
-
-    do {
-      dir = parent->r() == to_delete ? Direction::Right : Direction::Left;
-
-      sibling = parent->child(!dir);
-      distant_nephew = sibling->child(!dir);
-      close_nephew = sibling->child(dir);
-
-      if (sibling->color == Color::Red) {
-        // case 3
-        parent->rotate(dir);
-        parent->color = Color::Red;
-        sibling->color = Color::Black;
-        sibling = close_nephew;
-        // redundant?
-        distant_nephew = sibling->child(!dir);
-        if (distant_nephew != nullptr && distant_nephew->color == Color::Red) {
-          case6(parent, sibling, distant_nephew, dir);
-          return;
-        }
-        close_nephew = sibling->child(dir);
-        if (close_nephew != nullptr && close_nephew->color == Color::Red) {
-          case5(parent, sibling, close_nephew, distant_nephew, dir);
-          return;
-        }
-        sibling->color = Color::Red;
-        parent->color = Color::Black;
-        return;
-      }
-
-      if (distant_nephew != nullptr && distant_nephew->color == Color::Red) {
-        case6(parent, sibling, distant_nephew, dir);
-        return;
-      }
-
-      if (close_nephew != nullptr && close_nephew->color == Color::Red) {
-        case5(parent, sibling, close_nephew, distant_nephew, dir);
-        return;
-      }
-
-      if (parent->color == Color::Red) {
-        // case 4
-        sibling->color = Color::Red;
-        parent->color = Color::Black;
-        return;
-      }
-
-      // case 2
-      sibling->color = Color::Red;
-      to_delete = parent;
-      parent = to_delete->par();
-    } while (parent != nullptr);
-  }
+  // black leaf node with no kids
+  void complex_erase(Iterator pos) {}
 
 public:
   void erase(Iterator pos) {