Home
last modified time | relevance | path

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

12

/llvm-project-15.0.7/libcxx/src/
H A Dalgorithm.cpp15 template void __sort<__less<char>&, char*>(char*, char*, __less<char>&);
17 template void __sort<__less<wchar_t>&, wchar_t*>(wchar_t*, wchar_t*, __less<wchar_t>&);
21 template void __sort<__less<short>&, short*>(short*, short*, __less<short>&);
23 template void __sort<__less<int>&, int*>(int*, int*, __less<int>&);
24 template void __sort<__less<unsigned>&, unsigned*>(unsigned*, unsigned*, __less<unsigned>&);
25 template void __sort<__less<long>&, long*>(long*, long*, __less<long>&);
29 template void __sort<__less<float>&, float*>(float*, float*, __less<float>&);
30 template void __sort<__less<double>&, double*>(double*, double*, __less<double>&);
33 template bool __insertion_sort_incomplete<__less<char>&, char*>(char*, char*, __less<char>&);
41 template bool __insertion_sort_incomplete<__less<int>&, int*>(int*, int*, __less<int>&);
[all …]
/llvm-project-15.0.7/libcxx/include/__algorithm/
H A Dsort.h632 __less<uintptr_t> __comp;
636 extern template _LIBCPP_FUNC_VIS void __sort<__less<char>&, char*>(char*, char*, __less<char>&);
638 extern template _LIBCPP_FUNC_VIS void __sort<__less<wchar_t>&, wchar_t*>(wchar_t*, wchar_t*, __less…
642 extern template _LIBCPP_FUNC_VIS void __sort<__less<short>&, short*>(short*, short*, __less<short>&…
644 extern template _LIBCPP_FUNC_VIS void __sort<__less<int>&, int*>(int*, int*, __less<int>&);
645 extern template _LIBCPP_FUNC_VIS void __sort<__less<unsigned>&, unsigned*>(unsigned*, unsigned*, __…
646 extern template _LIBCPP_FUNC_VIS void __sort<__less<long>&, long*>(long*, long*, __less<long>&);
650 extern template _LIBCPP_FUNC_VIS void __sort<__less<float>&, float*>(float*, float*, __less<float>&…
651 extern template _LIBCPP_FUNC_VIS void __sort<__less<double>&, double*>(double*, double*, __less<dou…
654 …late _LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<char>&, char*>(char*, char*, __less<…
[all …]
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<typename iterator_traits<_ForwardIterator>::val… in minmax_element()
H A Dranges_minmax.h80 auto __less = [&](auto&& __a, auto&& __b) -> bool {
89 if (__less(*__first, __result.min))
97 if (__less(__i, __result.min))
99 else if (!__less(__i, __result.max))
104 if (__less(*__first, __i)) {
105 if (__less(*__first, __result.min))
107 if (!__less(__i, __result.max))
110 if (__less(__i, __result.min))
112 if (!__less(*__first, __result.max))
H A Dcomp.h54 struct __less
70 struct __less<_T1, _T1>
77 struct __less<const _T1, _T1>
84 struct __less<_T1, const _T1>
H A Dmax.h42 return _VSTD::max(__a, __b, __less<_Tp>()); in max()
63 return *_VSTD::max_element(__t.begin(), __t.end(), __less<_Tp>()); in max()
H A Dmin.h42 return _VSTD::min(__a, __b, __less<_Tp>()); in min()
63 return *_VSTD::min_element(__t.begin(), __t.end(), __less<_Tp>()); in min()
H A Dminmax.h42 return std::minmax(__a, __b, __less<_Tp>()); in minmax()
62 return std::minmax(__t, __less<_Tp>()); in minmax()
H A Dis_heap.h40 …return _VSTD::is_heap(__first, __last, __less<typename iterator_traits<_RandomAccessIterator>::val… in is_heap()
H A Dis_sorted.h40 …return _VSTD::is_sorted(__first, __last, __less<typename iterator_traits<_ForwardIterator>::value_… in is_sorted()
H A Dclamp.h40 return _VSTD::clamp(__v, __lo, __hi, __less<_Tp>()); in clamp()
H A Dbinary_search.h42 … __less<typename iterator_traits<_ForwardIterator>::value_type, _Tp>()); in binary_search()
H A Dmax_element.h53 __less<typename iterator_traits<_ForwardIterator>::value_type>()); in max_element()
H A Dis_sorted_until.h52 …return _VSTD::is_sorted_until(__first, __last, __less<typename iterator_traits<_ForwardIterator>::… in is_sorted_until()
H A Dmake_heap.h52 __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); in make_heap()
H A Dsort_heap.h51 __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); in sort_heap()
H A Dis_heap_until.h62 …return _VSTD::__is_heap_until(__first, __last, __less<typename iterator_traits<_RandomAccessIterat… in is_heap_until()
H A Dlexicographical_compare.h57 … __less<typename iterator_traits<_InputIterator1>::value_type, in lexicographical_compare()
H A Dmerge.h66 return _VSTD::merge(__first1, __last1, __first2, __last2, __result, __less<__v1, __v2>()); in merge()
H A Dlower_bound.h63 __less<typename iterator_traits<_ForwardIterator>::value_type, _Tp>()); in lower_bound()
H A Dprev_permutation.h75 … __less<typename iterator_traits<_BidirectionalIterator>::value_type>()); in prev_permutation()
/llvm-project-15.0.7/libcxx/include/__compare/
H A Dordering.h25 __less = -1, enumerator
133 inline constexpr partial_ordering partial_ordering::less(_OrdResult::__less);
218 inline constexpr weak_ordering weak_ordering::less(_OrdResult::__less);
310 inline constexpr strong_ordering strong_ordering::less(_OrdResult::__less);
/llvm-project-15.0.7/clang/test/SemaCXX/Inputs/
H A Dstd-compare.h14 __less = -1, enumerator
71 inline constexpr partial_ordering partial_ordering::less(_OrdResult::__less);
161 inline constexpr weak_ordering weak_ordering::less(_OrdResult::__less);
255 inline constexpr strong_ordering strong_ordering::less(_OrdResult::__less);
/llvm-project-15.0.7/clang/test/PCH/Inputs/
H A Dstd-compare.h14 __less = -1, enumerator
71 inline constexpr partial_ordering partial_ordering::less(_OrdResult::__less);
161 inline constexpr weak_ordering weak_ordering::less(_OrdResult::__less);
255 inline constexpr strong_ordering strong_ordering::less(_OrdResult::__less);
/llvm-project-15.0.7/clang/test/CodeGenCXX/Inputs/
H A Dstd-compare.h14 __less = -1, enumerator
71 inline constexpr partial_ordering partial_ordering::less(_OrdResult::__less);
161 inline constexpr weak_ordering weak_ordering::less(_OrdResult::__less);
255 inline constexpr strong_ordering strong_ordering::less(_OrdResult::__less);

12