Редагувати

Поділитися через

ITree<TKey,TValue>.lower_bound Method

  • Reference

Definition

Namespace:
Microsoft.VisualC.StlClr
Assembly:
Microsoft.VisualC.STLCLR.dll

Finds the beginning of the range of elements that match a specified key.

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

Parameters

unnamedParam1
ContainerBidirectionalIterator<TValue>

An iterator that designates the first element in the controlled sequence that hashes to the same bucket as _Keyval and has equivalent ordering to _Keyval. If no such element exists, it returns end(ContainerBidirectionalIterator<TValue>).

_Keyval
TKey

The key value for which to search.

Remarks

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).

Applies to