// *** Required Headers from the STL
#include <algorithm>
+#include <cstddef>
#include <functional>
#include <istream>
#include <ostream>
clear();
key_less = other.key_comp();
- if (other.size() != 0)
+ if (!other.empty())
{
stats.leaves = stats.innernodes = 0;
root = copy_recursive(other.root);
stats( other.stats ),
key_less( other.key_comp() )
{
- if (size() > 0)
+ if (!empty())
{
stats.leaves = stats.innernodes = 0;
root = copy_recursive(other.root);
slot -= inner->slotuse+1;
inner = static_cast<inner_node*>(*splitnode);
- BTREE_PRINT("btree::insert_descend switching to splitted node " << inner << " slot " << slot <<std::endl);
+ BTREE_PRINT("btree::insert_descend switching to split node " << inner << " slot " << slot <<std::endl);
}
}