Home
last modified time | relevance | path

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

/llvm-project-15.0.7/libcxx/include/__format/
H A Dextended_grapheme_cluster_table.h319 uint32_t __upper_bound = (__entries[__i] >> 11) + ((__entries[__i] >> 4) & 0x7f); in __get_property() local
320 if (__code_point <= __upper_bound) in __get_property()
/llvm-project-15.0.7/libcxx/include/__algorithm/
H A Dranges_upper_bound.h33 namespace __upper_bound {
67 inline constexpr auto upper_bound = __upper_bound::__fn{};
H A Dupper_bound.h32 __upper_bound(_Iter __first, _Sent __last, const _Tp& __value, _Compare&& __comp, _Proj&& __proj) { in __upper_bound() function
52 return std::__upper_bound<_ClassicAlgPolicy>( in upper_bound()
H A Dequal_range.h54 std::__upper_bound<_AlgPolicy>(++__mp1, __end, __value, __comp, __proj)); in __equal_range()
H A Dinplace_merge.h165 … __m1 = std::__upper_bound<_AlgPolicy>(__first, __middle, *__m2, __comp, std::__identity()); in __inplace_merge()
/llvm-project-15.0.7/libcxx/include/
H A D__tree1391 {return __upper_bound(__v, __root(), __end_node());}
1393 iterator __upper_bound(const _Key& __v,
1399 {return __upper_bound(__v, __root(), __end_node());}
1401 const_iterator __upper_bound(const _Key& __v,
2521 __upper_bound(__k, static_cast<__node_pointer>(__rt->__right_), __result)
2570 __tree<_Tp, _Compare, _Allocator>::__upper_bound(const _Key& __v,
2590 __tree<_Tp, _Compare, _Allocator>::__upper_bound(const _Key& __v,
2683 __upper_bound(__k, static_cast<__node_pointer>(__rt->__right_), __result));
2708 __upper_bound(__k, static_cast<__node_pointer>(__rt->__right_), __result));