search_containing_interval.cpp

template<typename Value>
Value search_containing_interval(
   std::vector<std::pair<double, Value>> const& intervals, double weight)
{
   auto it = std::lower_bound(
      intervals.begin(), intervals.end(), weight,
      [](auto const& element, double weight)
      {
         return element.first < weight;
      });
   return it->second; //By construction, always exists
}