/freebsd/contrib/llvm-project/libcxx/src/ |
H A D | algorithm.cpp | 29 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 … 34 template void __sort<__less<unsigned char>&, unsigned char*>(unsigned char*, unsigned char*, __less… 35 template void __sort<__less<short>&, short*>(short*, short*, __less<short>&); 36 template void __sort<__less<unsigned short>&, unsigned short*>(unsigned short*, unsigned 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>&); 40 template void __sort<__less<unsigned long>&, unsigned long*>(unsigned long*, unsigned long*, __less… [all …]
|
/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 | 134 struct __is_simple_comparator<__less<>&> : true_type {}; 893 extern template _LIBCPP_EXPORTED_FROM_ABI void __sort<__less<char>&, char*>(char*, char*, __less<ch… 895 …n template _LIBCPP_EXPORTED_FROM_ABI void __sort<__less<wchar_t>&, wchar_t*>(wchar_t*, wchar_t*, _… 898 __sort<__less<signed char>&, signed char*>(signed char*, signed char*, __less<signed char>&); 900 __sort<__less<unsigned char>&, unsigned char*>(unsigned char*, unsigned char*, __less<unsigned char… 901 …xtern template _LIBCPP_EXPORTED_FROM_ABI void __sort<__less<short>&, short*>(short*, short*, __les… 903 __sort<__less<unsigned short>&, unsigned short*>(unsigned short*, unsigned short*, __less<unsigned … 904 extern template _LIBCPP_EXPORTED_FROM_ABI void __sort<__less<int>&, int*>(int*, int*, __less<int>&); 906 __sort<__less<unsigned>&, unsigned*>(unsigned*, unsigned*, __less<unsigned>&); 907 extern template _LIBCPP_EXPORTED_FROM_ABI void __sort<__less<long>&, long*>(long*, long*, __less<lo… [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 | 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 | 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_heap.h | 33 return std::is_heap(__first, __last, __less<>()); in is_heap()
|
H A D | is_sorted.h | 33 return std::is_sorted(__first, __last, __less<>()); in is_sorted()
|
H A D | binary_search.h | 34 return std::binary_search(__first, __last, __value, __less<>()); in binary_search()
|
H A D | clamp.h | 38 return std::clamp(__v, __lo, __hi, __less<>()); in clamp()
|
H A D | max_element.h | 46 return std::max_element(__first, __last, __less<>()); in max_element()
|
H A D | is_sorted_until.h | 46 return std::is_sorted_until(__first, __last, __less<>()); in is_sorted_until()
|
H A D | lexicographical_compare.h | 52 return std::lexicographical_compare(__first1, __last1, __first2, __last2, __less<>()); in lexicographical_compare()
|
H A D | make_heap.h | 53 std::make_heap(std::move(__first), std::move(__last), __less<>()); in make_heap()
|
H A D | is_heap_until.h | 57 return std::__is_heap_until(__first, __last, __less<>()); in is_heap_until()
|
H A D | sort_heap.h | 56 std::sort_heap(std::move(__first), std::move(__last), __less<>()); in sort_heap()
|
H A D | merge.h | 64 return std::merge(__first1, __last1, __first2, __last2, __result, __less<>()); in merge()
|
H A D | prev_permutation.h | 68 return std::prev_permutation(__first, __last, __less<>());
|
H A D | next_permutation.h | 68 return std::next_permutation(__first, __last, __less<>());
|
H A D | upper_bound.h | 61 return std::upper_bound(std::move(__first), std::move(__last), __value, __less<>()); in upper_bound()
|
/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()
|
/freebsd/contrib/llvm-project/libcxx/include/__compare/ |
H A D | ordering.h | 25 enum class _OrdResult : signed char { __less = -1, __equiv = 0, __greater = 1 }; 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); 26 __less = -1, global() enumerator
|