ITree<TKey,TValue>.lower_bound Method
Definition
Important
Some information relates to prerelease product that may be substantially modified before it’s released. Microsoft makes no warranties, express or implied, with respect to the information provided here.
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 -> unitPublic Function lower_bound (ByRef unnamedParam1 As ContainerBidirectionalIterator(Of TValue), _Keyval As TKey) As VoidParameters
- 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
Werk met ons samen op GitHub
De bron voor deze inhoud vindt u op GitHub, waar u ook problemen en pull-aanvragen kunt maken en bekijken. Raadpleeg onze gids voor inzenders voor meer informatie.
