// *** Required Headers from the STL
#include <algorithm>
+#include <cstddef>
#include <functional>
#include <istream>
#include <ostream>
leaf_node *leaf = static_cast<leaf_node*>(n);
- int slot = find_lower(leaf, key);
+ unsigned short slot = find_lower(leaf, key);
return (slot < leaf->slotuse && key_equal(key, leaf->slotkey[slot]))
? iterator(leaf, slot) : end();
}
leaf_node *leaf = static_cast<leaf_node*>(n);
- int slot = find_summed_weight_lower(leaf, weight);
+ unsigned short slot = find_summed_weight_lower(leaf, weight);
for (unsigned short s = 0; s < slot; ++s)
weight -= leaf->weights[s];
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);
}
}
{
leaf_node *leaf = static_cast<leaf_node*>(n);
- int slot = find_lower(leaf, key);
+ unsigned short slot = find_lower(leaf, key);
if (!allow_duplicates && slot < leaf->slotuse && key_equal(key, leaf->slotkey[slot])) {
return std::pair<iterator, bool>(iterator(leaf, slot), false);