Home
last modified time | relevance | path

Searched refs:__upper_bound (Results 1 – 4 of 4) sorted by relevance

/freebsd-13.1/contrib/llvm-project/libcxx/include/__algorithm/
H A Dupper_bound.h28 __upper_bound(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, _Compare __co… in __upper_bound() function
55 return _VSTD::__upper_bound<_Comp_ref>(__first, __last, __value_, __comp); in upper_bound()
H A Dequal_range.h56 _VSTD::__upper_bound<_Compare>(++__mp1, __last, __value_, __comp) in __equal_range()
H A Dinplace_merge.h154 __m1 = _VSTD::__upper_bound<_Compare>(__first, __middle, *__m2, __comp); in __inplace_merge()
/freebsd-13.1/contrib/llvm-project/libcxx/include/
H A D__tree1394 {return __upper_bound(__v, __root(), __end_node());}
1396 iterator __upper_bound(const _Key& __v,
1402 {return __upper_bound(__v, __root(), __end_node());}
1404 const_iterator __upper_bound(const _Key& __v,
2524 __upper_bound(__k, static_cast<__node_pointer>(__rt->__right_), __result)
2573 __tree<_Tp, _Compare, _Allocator>::__upper_bound(const _Key& __v,
2593 __tree<_Tp, _Compare, _Allocator>::__upper_bound(const _Key& __v,
2686 __upper_bound(__k, static_cast<__node_pointer>(__rt->__right_), __result));
2711 __upper_bound(__k, static_cast<__node_pointer>(__rt->__right_), __result));