remove useless code

eBay · Jun 12, 2024 · 4053d14 · 4053d14
1 parent a1c48d2
commit 4053d14
Showing 1 changed file with 1 addition and 63 deletions.
diff --git a/src/include/homestore/btree/detail/simple_node.hpp b/src/include/homestore/btree/detail/simple_node.hpp
@@ -224,69 +224,7 @@ class SimpleNode : public VariantNode< K, V > {
         return str;
     }
 
-    std::string to_string_keys(bool print_friendly = false) const override {
-        // FIXME: Implement this, key may not be a unit32_t
-        return "";
-#if 0
-            std::string delimiter = print_friendly ? "\n" : "\t";
-            std::string snext = this->next_bnode() == empty_bnodeid ? "" : fmt::format("next_node={}", this->next_bnode());
-            auto str = fmt::format("{}{}.{} level:{} nEntries={} {} {} node_gen={} ",
-                                print_friendly ? "------------------------------------------------------------\n" : "",
-                                this->node_id(), this->link_version(), this->level(), this->total_entries(),
-                                (this->is_leaf() ? "LEAF" : "INTERIOR"), snext, this->node_gen());
-            if (!this->is_leaf() && (this->has_valid_edge())) {
-                fmt::format_to(std::back_inserter(str), "edge_id={}.{}", this->edge_info().m_bnodeid,
-                            this->edge_info().m_link_version);
-            }
-            if (this->total_entries() == 0) {
-                fmt::format_to(std::back_inserter(str), " [EMPTY] ");
-                return str;
-            }
-            if (!this->is_leaf()) {
-                fmt::format_to(std::back_inserter(str), " [");
-                for (uint32_t i{0}; i < this->total_entries(); ++i) {
-                    uint32_t cur_key = BtreeNode::get_nth_key< K >(i, false).key();
-                    BtreeLinkInfo child_info;
-                    get_nth_value(i, &child_info, false /* copy */);
-                    fmt::format_to(std::back_inserter(str), "{}.{} {}", cur_key, child_info.link_version(),
-                                i == this->total_entries() - 1 ? "" : ", ");
-                }
-                fmt::format_to(std::back_inserter(str), "]");
-                return str;
-            }
-            uint32_t prev_key = BtreeNode::get_nth_key< K >(0, false).key();
-            uint32_t cur_key = prev_key;
-            uint32_t last_key = BtreeNode::get_nth_key< K >(this->total_entries() - 1, false).key();
-            if (last_key - prev_key == this->total_entries() - 1) {
-                if (this->total_entries() == 1)
-                    fmt::format_to(std::back_inserter(str), "{}[{}]", delimiter, prev_key);
-                else
-                    fmt::format_to(std::back_inserter(str), "{}[{}-{}]", delimiter, prev_key, last_key);
-                return str;
-            }
-            fmt::format_to(std::back_inserter(str), "{}0 - [{}", delimiter, prev_key);
-            uint32_t start_interval_key = prev_key;
-            for (uint32_t i{1}; i < this->total_entries(); ++i) {
-                cur_key = BtreeNode::get_nth_key< K >(i, false).key();
-                if (cur_key != prev_key + 1) {
-                    if (start_interval_key == prev_key) {
-                        fmt::format_to(std::back_inserter(str), "-{}]{}{}- [{}", prev_key, delimiter, i, cur_key);
-                    } else {
-                        fmt::format_to(std::back_inserter(str), "]{}{}- [{}", delimiter, i, cur_key);
-                    }
-                    start_interval_key = cur_key;
-                }
-                prev_key = cur_key;
-            }
-
-            if (start_interval_key == prev_key) {
-                fmt::format_to(std::back_inserter(str), "]");
-            } else {
-                fmt::format_to(std::back_inserter(str), "-{}]", cur_key);
-            }
-            return str;
-#endif
-    }
+    std::string to_string_keys(bool print_friendly = false) const override { return "NOT Supported"; }
 
 #ifndef NDEBUG
     void validate_sanity() {