Home
last modified time | relevance | path

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

/freebsd/contrib/llvm-project/libcxx/include/__format/
H A Descaped_output_table.h852 uint32_t __upper_bound = (__entries[__i] >> 14) + (__entries[__i] & 0x3fffu); in __needs_escape() local
853 return __code_point <= __upper_bound; in __needs_escape()
H A Dwidth_estimation_table.h260 uint32_t __upper_bound = (__entries[__i] >> 14) + (__entries[__i] & 0x3fffu); in __estimated_width() local
261 return 1 + (__code_point <= __upper_bound); in __estimated_width()
H A Dindic_conjunct_break_table.h337 uint32_t __upper_bound = (__entries[__i] >> 11) + ((__entries[__i] >> 2) & 0b1'1111'1111); in __get_property() local
338 if (__code_point <= __upper_bound) in __get_property()
H A Dextended_grapheme_cluster_table.h1650 uint32_t __upper_bound = (__entries[__i] >> 11) + ((__entries[__i] >> 4) & 0x7f); in __get_property() local
1651 if (__code_point <= __upper_bound) in __get_property()
/freebsd/contrib/llvm-project/libcxx/include/__algorithm/
H A Dranges_upper_bound.h33 namespace __upper_bound {
66 inline constexpr auto upper_bound = __upper_bound::__fn{};
H A Dupper_bound.h35 __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 Dequal_range.h56 … std::__upper_bound<_AlgPolicy>(++__mp1, __end, __value, __comp, __proj)); in __equal_range()
H A Dinplace_merge.h168 __m1 = std::__upper_bound<_AlgPolicy>(__first, __middle, *__m2, __comp, std::__identity()); in __inplace_merge()
/freebsd/contrib/llvm-project/libcxx/include/
H A D__tree1205 return __upper_bound(__v, __root(), __end_node());
1208 …_LIBCPP_HIDE_FROM_ABI iterator __upper_bound(const _Key& __v, __node_pointer __root, __iter_pointe…
1211 return __upper_bound(__v, __root(), __end_node());
1215 __upper_bound(const _Key& __v, __node_pointer __root, __iter_pointer __result) const;
2128 __upper_bound(__k, static_cast<__node_pointer>(__rt->__right_), __result));
2164 __tree<_Tp, _Compare, _Allocator>::__upper_bound(const _Key& __v, __node_pointer __root, __iter_poi…
2177 …__tree<_Tp, _Compare, _Allocator>::const_iterator __tree<_Tp, _Compare, _Allocator>::__upper_bound(
2248 __upper_bound(__k, static_cast<__node_pointer>(__rt->__right_), __result));
2269 __upper_bound(__k, static_cast<__node_pointer>(__rt->__right_), __result));