Home
last modified time | relevance | path

Searched refs:__less (Results 1 – 25 of 41) sorted by relevance

12

/freebsd-14.2/contrib/llvm-project/libcxx/src/
H A Dalgorithm.cpp29 template void __sort<__less<char>&, char*>(char*, char*, __less<char>&);
31 template void __sort<__less<wchar_t>&, wchar_t*>(wchar_t*, wchar_t*, __less<wchar_t>&);
33 template void __sort<__less<signed char>&, signed char*>(signed char*, signed char*, __less<signed …
35 template void __sort<__less<short>&, short*>(short*, short*, __less<short>&);
37 template void __sort<__less<int>&, int*>(int*, int*, __less<int>&);
38 template void __sort<__less<unsigned>&, unsigned*>(unsigned*, unsigned*, __less<unsigned>&);
39 template void __sort<__less<long>&, long*>(long*, long*, __less<long>&);
41 template void __sort<__less<long long>&, long long*>(long long*, long long*, __less<long long>&);
43 template void __sort<__less<float>&, float*>(float*, float*, __less<float>&);
44 template void __sort<__less<double>&, double*>(double*, double*, __less<double>&);
[all …]
/freebsd-14.2/contrib/llvm-project/libcxx/include/__algorithm/
H A Dminmax_element.h44 auto __less = _MinmaxElementLessFunc<_Comp, _Proj>(__comp, __proj); in __minmax_element_impl() local
50 if (__less(__first, __result.first)) in __minmax_element_impl()
58 if (__less(__i, __result.first)) in __minmax_element_impl()
60 else if (!__less(__i, __result.second)) in __minmax_element_impl()
65 if (__less(__first, __i)) { in __minmax_element_impl()
66 if (__less(__first, __result.first)) in __minmax_element_impl()
68 if (!__less(__i, __result.second)) in __minmax_element_impl()
71 if (__less(__i, __result.first)) in __minmax_element_impl()
73 if (!__less(__first, __result.second)) in __minmax_element_impl()
96 return std::minmax_element(__first, __last, __less<>()); in minmax_element()
H A Dsort.h899 __sort<__less<signed char>&, signed char*>(signed char*, signed char*, __less<signed char>&);
901 __sort<__less<unsigned char>&, unsigned char*>(unsigned char*, unsigned char*, __less<unsigned char…
905 extern template _LIBCPP_EXPORTED_FROM_ABI void __sort<__less<int>&, int*>(int*, int*, __less<int>&);
907 __sort<__less<unsigned>&, unsigned*>(unsigned*, unsigned*, __less<unsigned>&);
910 __sort<__less<unsigned long>&, unsigned long*>(unsigned long*, unsigned long*, __less<unsigned long…
912 __sort<__less<long long>&, long long*>(long long*, long long*, __less<long long>&);
918 __sort<__less<long double>&, long double*>(long double*, long double*, __less<long double>&);
961 __less<_Type> __comp;
967 __less<_Type> __comp;
974 __less<_Type> __comp;
[all …]
H A Dranges_minmax.h104 auto __less = [&](auto&& __a, auto&& __b) -> bool {
116 if (__less(*__first, __result.min))
124 if (__less(__i, __result.min))
126 else if (!__less(__i, __result.max))
131 if (__less(*__first, __i)) {
132 if (__less(*__first, __result.min))
134 if (!__less(__i, __result.max))
137 if (__less(__i, __result.min))
139 if (!__less(*__first, __result.max))
H A Dcomp.h35 struct __less {};
38 struct __less<void, void> {
H A Dmax.h36 return std::max(__a, __b, __less<>()); in max()
49 return *std::max_element(__t.begin(), __t.end(), __less<>()); in max()
H A Dmin.h36 return std::min(__a, __b, __less<>()); in min()
49 return *std::min_element(__t.begin(), __t.end(), __less<>()); in min()
H A Dminmax.h35 return std::minmax(__a, __b, __less<>()); in minmax()
52 return std::minmax(__t, __less<>()); in minmax()
H A Dis_heap.h33 return std::is_heap(__first, __last, __less<>()); in is_heap()
H A Dis_sorted.h33 return std::is_sorted(__first, __last, __less<>()); in is_sorted()
H A Dbinary_search.h34 return std::binary_search(__first, __last, __value, __less<>()); in binary_search()
H A Dclamp.h38 return std::clamp(__v, __lo, __hi, __less<>()); in clamp()
H A Dis_sorted_until.h46 return std::is_sorted_until(__first, __last, __less<>()); in is_sorted_until()
H A Dmax_element.h46 return std::max_element(__first, __last, __less<>()); in max_element()
H A Dlexicographical_compare.h52 return std::lexicographical_compare(__first1, __last1, __first2, __last2, __less<>()); in lexicographical_compare()
H A Dis_heap_until.h57 return std::__is_heap_until(__first, __last, __less<>()); in is_heap_until()
H A Dmake_heap.h53 std::make_heap(std::move(__first), std::move(__last), __less<>()); in make_heap()
H A Dsort_heap.h56 std::sort_heap(std::move(__first), std::move(__last), __less<>()); in sort_heap()
H A Dmerge.h64 return std::merge(__first1, __last1, __first2, __last2, __result, __less<>()); in merge()
H A Dprev_permutation.h68 return std::prev_permutation(__first, __last, __less<>()); in prev_permutation()
H A Dupper_bound.h61 return std::upper_bound(std::move(__first), std::move(__last), __value, __less<>()); in upper_bound()
H A Dlower_bound.h60 return std::lower_bound(__first, __last, __value, __less<>()); in lower_bound()
H A Dnext_permutation.h68 return std::next_permutation(__first, __last, __less<>()); in next_permutation()
/freebsd-14.2/contrib/llvm-project/libcxx/include/__utility/
H A Dis_pointer_in_range.h47 return !__less<>()(__ptr, __begin) && __less<>()(__ptr, __end);
/freebsd-14.2/contrib/llvm-project/libcxx/include/__compare/
H A Dordering.h25 enum class _OrdResult : signed char { __less = -1, __equiv = 0, __greater = 1 }; enumerator
114 inline constexpr partial_ordering partial_ordering::less(_OrdResult::__less);
185 inline constexpr weak_ordering weak_ordering::less(_OrdResult::__less);
263 inline constexpr strong_ordering strong_ordering::less(_OrdResult::__less);

12