Partager via

lower_bound (STL/CLR)

  • Article

 

The new home for Visual Studio documentation is Visual Studio 2017 Documentation on docs.microsoft.com.

The latest version of this topic can be found at lower_bound (STL/CLR).

Finds the position of the first element in an ordered range that has a value less than or equivalent to a specified value, where the ordering criterion may be specified by a binary predicate.

Syntax

template<class _FwdIt, class _Ty> inline  
    _FwdIt lower_bound(_FwdIt _First, _FwdIt _Last, const _Ty% _Val);  
template<class _FwdIt, class _Ty, class _Pr> inline  
    _FwdIt lower_bound(_FwdIt _First, _FwdIt _Last,  
        const _Ty% _Val, _Pr _Pred);

Remarks

This function behaves the same as the STL function lower_bound. For more information, see lower_bound.

Requirements

Header: <cliext/algorithm>

Namespace: cliext

See Also

algorithm (STL/CLR)