ITree<TKey,TValue>.upper_bound(ContainerBidirectionalIterator<TValue>, TKey) ITree<TKey,TValue>.upper_bound(ContainerBidirectionalIterator<TValue>, TKey) ITree<TKey,TValue>.upper_bound(ContainerBidirectionalIterator<TValue>, TKey) ITree<TKey,TValue>.upper_bound(ContainerBidirectionalIterator<TValue>, TKey) Method

Definición

Busca el final del intervalo de elementos que coincidan con una clave especificada.Finds the end of the range of elements that match a specified key.

public:
 void ^ upper_bound(Microsoft::VisualC::StlClr::Generic::ContainerBidirectionalIterator<TValue> ^ % , TKey _Keyval);
public void upper_bound (ref Microsoft.VisualC.StlClr.Generic.ContainerBidirectionalIterator<TValue> , TKey _Keyval);
abstract member upper_bound : ContainerBidirectionalIterator * 'Key -> unit
Public Function upper_bound (ByRef  As ContainerBidirectionalIterator(Of TValue), _Keyval As TKey) As Void

Parámetros

_Keyval
TKey TKey TKey TKey

Valor de clave en el que se va a buscar.The key value to search for.

Comentarios

Para obtener más información, vea_hash map:: upper_bound (STL/CLR), hash_Multimap:: upper_bound (STL/CLR), hash_set:: upper_bound (STL/CLR)y hash_MultiSet:: upper_bound (STL/CLR).For more information, see hash_map::upper_bound (STL/CLR), hash_multimap::upper_bound (STL/CLR), hash_set::upper_bound (STL/CLR), and hash_multiset::upper_bound (STL/CLR).

Se aplica a