ITree<TKey,TValue>.upper_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 end of the range of elements that match a specified key.
public:
void ^ upper_bound(Microsoft::VisualC::StlClr::Generic::ContainerBidirectionalIterator<TValue> ^ % unnamedParam1, TKey _Keyval);public void upper_bound (ref Microsoft.VisualC.StlClr.Generic.ContainerBidirectionalIterator<TValue> unnamedParam1, TKey _Keyval);abstract member upper_bound : ContainerBidirectionalIterator * 'Key -> unitPublic Function upper_bound (ByRef unnamedParam1 As ContainerBidirectionalIterator(Of TValue), _Keyval As TKey) As VoidParameters
- unnamedParam1
- ContainerBidirectionalIterator<TValue>
An iterator that designates the first element beyond the last 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 to search for.
Remarks
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).
