min_max

Author: tzaeschke

include/phtree/common/b_plus_tree_base.h

@@ -107,7 +107,6 @@ class bpt_node_data : public bpt_node_base<KeyT, NInnerT, NLeafT> {
     [[nodiscard]] auto lower_bound(KeyT key) noexcept {
         // If this doesn´t compile, check #include <algorithm> !!!
         return std::lower_bound(data_.begin(), data_.end(), key, [](EntryT& left, const KeyT key) {
-            // return left.first < key;
             return Compare{}(left.first, key);
         });
     }
@@ -397,7 +396,6 @@ class bpt_node_inner : public bpt_node_data<
         for (auto& e : this->data_) {
             assert(n == 0 || !Compare{}(e.first, prev_key));
             e.second->_check(count, this, prev_leaf, known_min, e.first);
-            // assert(this->parent_ == nullptr || e.first <= known_max);
             assert(this->parent_ == nullptr || !Compare{}(known_max, e.first));
             prev_key = e.first;
             ++n;
@@ -435,12 +433,10 @@ class bpt_node_inner : public bpt_node_data<
 
         // update child1
         auto it = dest->lower_bound_node(key1_old, child1);
-        // assert(key1_old >= key1_new && it != dest->data_.end());
         assert(!Compare{}(key1_old, key1_new) && it != dest->data_.end());
         it->first = key1_new;
 
         if (dest == this && this->next_node_ != nullptr) {
-            // assert(this->next_node_->data_.front().first >= key1_new);
             assert(!Compare{}(this->next_node_->data_.front().first, key1_new));
         }
         ++it;

include/phtree/common/b_plus_tree_multimap.h

@@ -75,8 +75,6 @@ namespace phtree::bptree {
  */
 template <typename KeyT, typename ValueT, typename Compare = std::less<KeyT>>
 class b_plus_tree_multimap {
-    // static_assert(std::is_integral<KeyT>() && "Key type must be integer");
-    // static_assert(std::is_unsigned<KeyT>() && "Key type must unsigned");
     static_assert(std::is_arithmetic<KeyT>() && "Key type must integral or floating point");
 
     class bpt_node_leaf;
@@ -352,9 +350,7 @@ class b_plus_tree_multimap {
 
             assert(prev_leaf == this->prev_node_);
             for (auto& e : this->data_) {
-                // assert(count == 0 || e.first >= known_min);
                 assert(count == 0 || !Compare{}(e.first, known_min));
-                // assert(this->parent_ == nullptr || e.first <= known_max);
                 assert(this->parent_ == nullptr || !Compare{}(known_max, e.first));
                 ++count;
                 known_min = e.first;