From 642003fe4fb07e019d810b36597125ac35680bce Mon Sep 17 00:00:00 2001
From: Andrew Noyes <andrew@weaselab.dev>
Date: Thu, 15 Feb 2024 15:03:33 -0800
Subject: [PATCH] Remove dead code

---
 ConflictSet.cpp | 69 -------------------------------------------------
 1 file changed, 69 deletions(-)

diff --git a/ConflictSet.cpp b/ConflictSet.cpp
index 69ac5bd..108616c 100644
--- a/ConflictSet.cpp
+++ b/ConflictSet.cpp
@@ -914,75 +914,6 @@ bytes:
   return i;
 }
 
-bool checkRangeStartsWith(Node *n, std::span<const uint8_t> key,
-                          int64_t readVersion) {
-#if DEBUG_VERBOSE && !defined(NDEBUG)
-  fprintf(stderr, "%s*\n", printable(key).c_str());
-#endif
-  auto remaining = key;
-
-  for (;;) {
-    if (n->maxVersion <= readVersion) {
-      return true;
-    }
-
-    if (remaining.size() == 0) {
-      return n->maxVersion <= readVersion;
-    }
-
-    int c = getChildGeq(n, remaining[0]);
-    if (c == remaining[0]) {
-      n = getChildExists(n, c);
-      remaining = remaining.subspan(1, remaining.size() - 1);
-    } else {
-      if (c >= 0) {
-        n = getChildExists(n, c);
-        goto downLeftSpine;
-      } else {
-        n = nextSibling(n);
-        goto downLeftSpine;
-      }
-    }
-
-    if (n->partialKeyLen > 0) {
-      int commonLen = std::min<int>(n->partialKeyLen, remaining.size());
-      for (int i = 0; i < commonLen; ++i) {
-        auto c = n->partialKey[i] <=> remaining[i];
-        if (c == 0) {
-          continue;
-        }
-        if (c > 0) {
-          goto downLeftSpine;
-        } else {
-          n = nextSibling(n);
-          goto downLeftSpine;
-        }
-      }
-      if (commonLen == n->partialKeyLen) {
-        // partial key matches
-        remaining = remaining.subspan(commonLen, remaining.size() - commonLen);
-      } else if (n->partialKeyLen > int(remaining.size())) {
-        if (n->entryPresent && n->entry.rangeVersion > readVersion) {
-          return false;
-        }
-        return n->maxVersion <= readVersion;
-      }
-    }
-  }
-downLeftSpine:
-  if (n == nullptr) {
-    return true;
-  }
-  for (;;) {
-    if (n->entryPresent) {
-      return n->entry.rangeVersion <= readVersion;
-    }
-    int c = getChildGeq(n, 0);
-    assert(c >= 0);
-    n = getChildExists(n, c);
-  }
-}
-
 // Return true if the max version among all keys that start with key + [child],
 // where begin < child < end, is <= readVersion
 bool checkRangeStartsWith(Node *n, std::span<const uint8_t> key, int begin,