| /freebsd/contrib/llvm-project/libcxx/src/ |
| H A D | algorithm.cpp | 31 template void __sort<__less<char>&, char*>(char*, char*, __less<char>&);
33 template void __sort<__less<wchar_t>&, wchar_t*>(wchar_t*, wchar_t*, __less<wchar_t>&);
35 template void __sort<__less<signed char>&, signed char*>(signed char*, signed char*, __less<signed …
36 template void __sort<__less<unsigned char>&, unsigned char*>(unsigned char*, unsigned char*, __less…
37 template void __sort<__less<short>&, short*>(short*, short*, __less<short>&);
38 template void __sort<__less<unsigned short>&, unsigned short*>(unsigned short*, unsigned short*, __…
39 template void __sort<__less<int>&, int*>(int*, int*, __less<int>&);
40 template void __sort<__less<unsigned>&, unsigned*>(unsigned*, unsigned*, __less<unsigned>&);
41 template void __sort<__less<long>&, long*>(long*, long*, __less<long>&);
42 template void __sort<__less<unsigned long>&, unsigned long*>(unsigned long*, unsigned long*, __less…
[all …]
|
| /freebsd/contrib/llvm-project/libcxx/include/__cxx03/__algorithm/ |
| H A D | minmax_element.h | 43 auto __less = _MinmaxElementLessFunc<_Comp, _Proj>(__comp, __proj); in __minmax_element_impl() local
49 if (__less(__first, __result.first)) in __minmax_element_impl()
57 if (__less(__i, __result.first)) in __minmax_element_impl()
59 else if (!__less(__i, __result.second)) in __minmax_element_impl()
64 if (__less(__first, __i)) { in __minmax_element_impl()
65 if (__less(__first, __result.first)) in __minmax_element_impl()
67 if (!__less(__i, __result.second)) in __minmax_element_impl()
70 if (__less(__i, __result.first)) in __minmax_element_impl()
72 if (!__less(__first, __result.second)) in __minmax_element_impl()
94 return std::minmax_element(__first, __last, __less<>()); in minmax_element()
|
| H A D | sort.h | 132 struct __is_simple_comparator<__less<>&> : true_type {};
885 extern template _LIBCPP_EXPORTED_FROM_ABI void __sort<__less<char>&, char*>(char*, char*, __less<ch…
887 …n template _LIBCPP_EXPORTED_FROM_ABI void __sort<__less<wchar_t>&, wchar_t*>(wchar_t*, wchar_t*, _…
890 __sort<__less<signed char>&, signed char*>(signed char*, signed char*, __less<signed char>&);
892 __sort<__less<unsigned char>&, unsigned char*>(unsigned char*, unsigned char*, __less<unsigned char…
893 …xtern template _LIBCPP_EXPORTED_FROM_ABI void __sort<__less<short>&, short*>(short*, short*, __les…
895 __sort<__less<unsigned short>&, unsigned short*>(unsigned short*, unsigned short*, __less<unsigned …
896 extern template _LIBCPP_EXPORTED_FROM_ABI void __sort<__less<int>&, int*>(int*, int*, __less<int>&);
898 __sort<__less<unsigned>&, unsigned*>(unsigned*, unsigned*, __less<unsigned>&);
899 extern template _LIBCPP_EXPORTED_FROM_ABI void __sort<__less<long>&, long*>(long*, long*, __less<lo…
[all …]
|
| H A D | comp.h | 34 struct __less {}; struct
37 struct __less<void, void> {
45 inline const bool __desugars_to_v<__less_tag, __less<>, _Tp, _Tp> = true;
|
| H A D | is_sorted.h | 32 return std::is_sorted(__first, __last, __less<>()); in is_sorted()
|
| H A D | is_heap.h | 33 return std::is_heap(__first, __last, __less<>()); in is_heap()
|
| H A D | min.h | 35 return std::min(__a, __b, __less<>()); in min()
|
| H A D | max.h | 35 return std::max(__a, __b, __less<>()); in max()
|
| H A D | minmax.h | 34 return std::minmax(__a, __b, __less<>()); in minmax()
|
| H A D | binary_search.h | 34 return std::binary_search(__first, __last, __value, __less<>()); in binary_search()
|
| /freebsd/contrib/llvm-project/libcxx/include/__algorithm/ |
| H A D | minmax_element.h | 44 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()
95 return std::minmax_element(__first, __last, __less<>()); in minmax_element()
|
| H A D | sort.h | 834 extern template _LIBCPP_EXPORTED_FROM_ABI void __sort<__less<char>&, char*>(char*, char*, __less<ch…
836 …n template _LIBCPP_EXPORTED_FROM_ABI void __sort<__less<wchar_t>&, wchar_t*>(wchar_t*, wchar_t*, _…
839 __sort<__less<signed char>&, signed char*>(signed char*, signed char*, __less<signed char>&);
841 __sort<__less<unsigned char>&, unsigned char*>(unsigned char*, unsigned char*, __less<unsigned char…
842 …xtern template _LIBCPP_EXPORTED_FROM_ABI void __sort<__less<short>&, short*>(short*, short*, __les…
844 __sort<__less<unsigned short>&, unsigned short*>(unsigned short*, unsigned short*, __less<unsigned …
845 extern template _LIBCPP_EXPORTED_FROM_ABI void __sort<__less<int>&, int*>(int*, int*, __less<int>&);
847 __sort<__less<unsigned>&, unsigned*>(unsigned*, unsigned*, __less<unsigned>&);
848 extern template _LIBCPP_EXPORTED_FROM_ABI void __sort<__less<long>&, long*>(long*, long*, __less<lo…
850 __sort<__less<unsigned long>&, unsigned long*>(unsigned long*, unsigned long*, __less<unsigned long…
[all …]
|
| H A D | ranges_minmax.h | 119 auto __less = [&](auto&& __a, auto&& __b) -> bool {
131 if (__less(*__first, __result.min))
139 if (__less(__i, __result.min))
141 else if (!__less(__i, __result.max))
146 if (__less(*__first, __i)) {
147 if (__less(*__first, __result.min))
149 if (!__less(__i, __result.max))
152 if (__less(__i, __result.min))
154 if (!__less(*__first, __result.max))
|
| H A D | comp.h | 35 struct __less {}; struct
38 struct __less<void, void> {
46 inline const bool __desugars_to_v<__less_tag, __less<>, _Tp, _Tp> = true;
49 inline const bool __desugars_to_v<__totally_ordered_less_tag, __less<>, _Tp, _Tp> = is_integral<_Tp…
|
| H A D | min.h | 36 return std::min(__a, __b, __less<>()); in min()
49 return *std::min_element(__t.begin(), __t.end(), __less<>()); in min()
|
| H A D | max.h | 36 return std::max(__a, __b, __less<>()); in max()
49 return *std::max_element(__t.begin(), __t.end(), __less<>()); in max()
|
| H A D | minmax.h | 35 return std::minmax(__a, __b, __less<>()); in minmax()
52 return std::minmax(__t, __less<>()); in minmax()
|
| H A D | is_sorted.h | 32 return std::is_sorted(__first, __last, __less<>()); in is_sorted()
|
| H A D | is_heap.h | 32 return std::is_heap(__first, __last, __less<>()); in is_heap()
|
| H A D | binary_search.h | 33 return std::binary_search(__first, __last, __value, __less<>()); in binary_search()
|
| /freebsd/contrib/llvm-project/libcxx/include/__compare/ |
| H A D | ordering.h | 25 enum class _OrdResult : signed char { __less = -1, __equiv = 0, __greater = 1 }; enumerator
28 __less = static_cast<signed char>(_OrdResult::__less), enumerator
72 return __v.__value_ == _PartialOrdResult::__less;
76 return __v.__value_ == _PartialOrdResult::__equiv || __v.__value_ == _PartialOrdResult::__less;
96 return __v.__value_ == _PartialOrdResult::__less;
100 return __v.__value_ == _PartialOrdResult::__equiv || __v.__value_ == _PartialOrdResult::__less;
117 inline constexpr partial_ordering partial_ordering::less(_PartialOrdResult::__less);
188 inline constexpr weak_ordering weak_ordering::less(_OrdResult::__less);
266 inline constexpr strong_ordering strong_ordering::less(_OrdResult::__less);
|
| /freebsd/contrib/llvm-project/libcxx/include/__cxx03/__utility/ |
| H A D | is_pointer_in_range.h | 47 return !__less<>()(__ptr, __begin) && __less<>()(__ptr, __end);
|
| H A D | is_valid_range.h | 31 return !__less<>()(__last, __first); in __is_valid_range()
|
| /freebsd/contrib/llvm-project/libcxx/include/__utility/ |
| H A D | is_pointer_in_range.h | 47 return !__less<>()(__ptr, __begin) && __less<>()(__ptr, __end);
|
| H A D | is_valid_range.h | 32 return !__less<>()(__last, __first); in __is_valid_range()
|