ITree<TKey,TValue>.lower_bound(ContainerBidirectionalIterator<TValue>, TKey) Método
Definição
Localiza o início do intervalo de elementos que correspondem a uma chave 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
O valor de chave pelo qual pesquisar.The key value for which to search.
Comentários
Para obter mais informações, consulte _ hash map:: LOWER_BOUND (STL/CLR), hash _ MULTIMAP:: lower_bound (STL/CLR), conjunto de hash _ :: lower_bound (STL/CLR)e hash _ multiconjunto:: 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).