| /freebsd/contrib/llvm-project/libcxx/include/__format/ |
| H A D | escaped_output_table.h | 876 uint32_t __upper_bound = (__entries[__i] >> 14) + (__entries[__i] & 0x3fffu); in __needs_escape() local
877 return __code_point <= __upper_bound; in __needs_escape()
|
| H A D | width_estimation_table.h | 263 uint32_t __upper_bound = (__entries[__i] >> 14) + (__entries[__i] & 0x3fffu); in __estimated_width() local
264 return 1 + (__code_point <= __upper_bound); in __estimated_width()
|
| H A D | indic_conjunct_break_table.h | 539 uint32_t __upper_bound = (__entries[__i] >> 11) + ((__entries[__i] >> 2) & 0b1'1111'1111); in __get_property() local
540 if (__code_point <= __upper_bound) in __get_property()
|
| H A D | extended_grapheme_cluster_table.h | 1655 uint32_t __upper_bound = (__entries[__i] >> 11) + ((__entries[__i] >> 4) & 0x7f); in __get_property() local
1656 if (__code_point <= __upper_bound) in __get_property()
|
| /freebsd/contrib/llvm-project/libcxx/include/__algorithm/ |
| H A D | ranges_upper_bound.h | 33 struct __upper_bound { struct
64 inline constexpr auto upper_bound = __upper_bound{}; argument
|
| H A D | upper_bound.h | 37 __upper_bound(_Iter __first, _Sent __last, const _Tp& __value, _Compare&& __comp, _Proj&& __proj) { in __upper_bound() function
57 return std::__upper_bound<_ClassicAlgPolicy>( in upper_bound()
|
| H A D | equal_range.h | 52 … std::__upper_bound<_AlgPolicy>(++__mp1, __end, __value, __comp, __proj)); in __equal_range()
|
| H A D | inplace_merge.h | 168 __m1 = std::__upper_bound<_AlgPolicy>(__first, __middle, *__m2, __comp, std::__identity()); in __inplace_merge()
|
| /freebsd/contrib/llvm-project/libcxx/include/__cxx03/__algorithm/ |
| H A D | upper_bound.h | 35 __upper_bound(_Iter __first, _Sent __last, const _Tp& __value, _Compare&& __comp, _Proj&& __proj) { in __upper_bound() function
54 return std::__upper_bound<_ClassicAlgPolicy>( in upper_bound()
|
| H A D | equal_range.h | 56 … std::__upper_bound<_AlgPolicy>(++__mp1, __end, __value, __comp, __proj)); in __equal_range()
|
| H A D | inplace_merge.h | 168 __m1 = std::__upper_bound<_AlgPolicy>(__first, __middle, *__m2, __comp, std::__identity()); in __inplace_merge()
|
| /freebsd/contrib/llvm-project/libcxx/include/__flat_map/ |
| H A D | flat_multimap.h | 677 …_LIBCPP_HIDE_FROM_ABI iterator upper_bound(const key_type& __x) { return __upper_bound<iterator>(*… in upper_bound()
680 return __upper_bound<const_iterator>(*this, __x); in upper_bound()
686 return __upper_bound<iterator>(*this, __x); in upper_bound()
692 return __upper_bound<const_iterator>(*this, __x); in upper_bound()
822 _LIBCPP_HIDE_FROM_ABI static _Res __upper_bound(_Self&& __self, _Kp& __x) { in __upper_bound() function
|
| H A D | flat_map.h | 831 return __upper_bound<iterator>(*this, __x); in upper_bound()
835 return __upper_bound<const_iterator>(*this, __x); in upper_bound()
841 return __upper_bound<iterator>(*this, __x); in upper_bound()
847 return __upper_bound<const_iterator>(*this, __x); in upper_bound()
1007 …_LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX26 static _Res __upper_bound(_Self&& __self, _Kp&… in __upper_bound() function
|
| /freebsd/contrib/llvm-project/libcxx/include/__cxx03/ |
| H A D | __tree | 1151 return __upper_bound(__v, __root(), __end_node());
1154 …_LIBCPP_HIDE_FROM_ABI iterator __upper_bound(const _Key& __v, __node_pointer __root, __iter_pointe…
1157 return __upper_bound(__v, __root(), __end_node());
1161 __upper_bound(const _Key& __v, __node_pointer __root, __iter_pointer __result) const;
1936 __upper_bound(__k, static_cast<__node_pointer>(__rt->__right_), __result));
1972 __tree<_Tp, _Compare, _Allocator>::__upper_bound(const _Key& __v, __node_pointer __root, __iter_poi…
1985 …__tree<_Tp, _Compare, _Allocator>::const_iterator __tree<_Tp, _Compare, _Allocator>::__upper_bound(
2056 __upper_bound(__k, static_cast<__node_pointer>(__rt->__right_), __result));
2077 __upper_bound(__k, static_cast<__node_pointer>(__rt->__right_), __result));
|
| /freebsd/contrib/llvm-project/libcxx/include/ |
| H A D | __tree | 1102 return __upper_bound(__v, __root(), __end_node());
1105 …_LIBCPP_HIDE_FROM_ABI iterator __upper_bound(const _Key& __v, __node_pointer __root, __end_node_po…
1108 return __upper_bound(__v, __root(), __end_node());
1112 __upper_bound(const _Key& __v, __node_pointer __root, __end_node_pointer __result) const;
2040 __upper_bound(__k, static_cast<__node_pointer>(__rt->__right_), __result));
2076 __tree<_Tp, _Compare, _Allocator>::__upper_bound(const _Key& __v, __node_pointer __root, __end_node…
2089 …__tree<_Tp, _Compare, _Allocator>::const_iterator __tree<_Tp, _Compare, _Allocator>::__upper_bound(
2160 __upper_bound(__k, static_cast<__node_pointer>(__rt->__right_), __result));
2181 __upper_bound(__k, static_cast<__node_pointer>(__rt->__right_), __result));
|