binary_search (STL/CLR)

Tests whether there is an element in a sorted range that is equal to a specified value or that is equivalent to it in a sense specified by a binary predicate.

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

Remarks

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

Requirements

Header: <cliext/algorithm>

Namespace: cliext

See Also

Reference

algorithm (STL/CLR)