Standard C++ Library Class Reference

Click on the banner to return to the Class Reference home page.
©Copyright 1996 Rogue Wave Software
lower_bound
Algorithm
Summary
Determine the first valid position for an element in a sorted container.
Contents
Synopsis●
Description●
Complexity●
Example●
Warning●
See Also●
Synopsis
template <class ForwardIterator, class T>
ForwardIterator lower_bound(ForwardIterator first,
ForwardIterator last,
const T& value);
template <class ForwardIterator, class T, class Compare>
ForwardIterator lower_bound(ForwardIterator first,
ForwardIterator last,
const T& value, Compare comp);
Description
The lower_bound algorithm compares a supplied value to elements in a sorted container and
returns the first postition in the container that value can occupy without violating the container's