| title |
upper_bound (STL/CLR) | Microsoft Docs |
| ms.custom |
|
| ms.date |
11/04/2016 |
| ms.reviewer |
|
| ms.suite |
|
| ms.technology |
|
| ms.tgt_pltfrm |
|
| ms.topic |
reference |
| f1_keywords |
|
| dev_langs |
|
| helpviewer_keywords |
upper_bound function [STL/CLR] |
|
| ms.assetid |
a377a77b-8005-496e-85ae-b431a9b2f0b9 |
| caps.latest.revision |
4 |
| author |
mikeblome |
| ms.author |
mblome |
| manager |
ghogen |
| translation.priority.ht |
cs-cz |
de-de |
es-es |
fr-fr |
it-it |
ja-jp |
ko-kr |
pl-pl |
pt-br |
ru-ru |
tr-tr |
zh-cn |
zh-tw |
|
Finds the position of the first element in an ordered range that has a value that is greater than a specified value, where the ordering criterion may be specified by a binary predicate.
template<class _FwdIt, class _Ty> inline
_FwdIt upper_bound(_FwdIt _First, _FwdIt _Last, const _Ty% _Val);
template<class _FwdIt, class _Ty, class _Pr> inline
_FwdIt upper_bound(_FwdIt _First, _FwdIt _Last,
const _Ty% _Val, _Pr _Pred);
Remarks
This function behaves the same as the C++ Standard Library function upper_bound. For more information, see upper_bound.
Header: <cliext/algorithm>
Namespace: cliext
algorithm (STL/CLR)