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

Definición

Busca el principio del intervalo de elementos que coinciden con una clave especificada.Finds the beginning of the range of elements that match a specified key.

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

Parámetros

_Keyval
TKey TKey TKey TKey

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

Comentarios

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

Se aplica a