// for (double x : _binsearcher.edges()) std::cout << x << std::endl;
// Now merge the in-range bins
size_t jcurr = 0;
for (size_t i = 1; i < newedges.size(); ++i) { //< we already know that i=0 matches (until we support merging into overflows)
const size_t kmatch = _binsearcher.index(newedges.at(i)) - 1; //< Will match the *next* bin, so step back one unit... and note these are BinSearcher indices
assert(kmatch >= jcurr+1);
mergeBins(jcurr, kmatch-1);
jcurr += 1; //< The next bin to be merged, in the new numbering
}
// std::cout << "After merging" << std::endl;
// for (double x : _binsearcher.edges()) std::cout << x << std::endl;