Function lower_bound

src/fl/stl/algorithm.h:551–553

// Lower bound: find first position in sorted [first, last) where value could be inserted.
template <typename Iterator, typename T, typename Compare>
Iterator lower_bound(Iterator first, Iterator last, const T& value, Compare comp) FL_NOEXCEPT {
    return detail::lower_bound_impl(first, last, value, comp);
}

template <typename Iterator, typename T>
Iterator lower_bound(Iterator first, Iterator last, const T& value) FL_NOEXCEPT {