| /external/llvm-libc/src/stdlib/ |
| D | quick_sort.h | 29 const F &is_less) { in partition_lomuto_branchless()
54 const F &is_less) { in partition_hoare_branchy()
83 const F &is_less) { in partition()
110 size_t limit, const F &is_less) { in quick_sort_impl()
175 LIBC_INLINE void quick_sort(A &array, const F &is_less) { in quick_sort()
|
| D | qsort_pivot.h | 27 LIBC_INLINE size_t choose_pivot(const A &array, const F &is_less) { in choose_pivot()
53 size_t n, const F &is_less) { in median3_rec()
66 const F &is_less) { in median3()
|
| D | qsort_util.h | 32 size_t elem_size, const F &is_less) { in unstable_sort_impl()
68 const F &is_less) { in unstable_sort()
|
| D | qsort.cpp | 22 const auto is_less = [compare](const void *a, const void *b) -> bool { in __anona6438f6a0102() variable
|
| D | qsort_r.cpp | 23 const auto is_less = [compare, arg](const void *a, const void *b) -> bool { in __anonb89ceedb0102() variable
|
| D | heap_sort.h | 22 LIBC_INLINE void heap_sort(const A &array, const F &is_less) { in heap_sort()
|
| /external/sdv/vsomeip/third_party/boost/algorithm/include/boost/algorithm/string/ |
| D | compare.hpp | 86 struct is_less struct
93 bool operator()( const T1& Arg1, const T2& Arg2 ) const in operator ()()
|
| /external/sdv/vsomeip/third_party/boost/multi_index/test/ |
| D | test_composite_key.cpp | 116 static bool is_less(const CompositeKeyResult& x,const T2& y) in is_less() function
189 static bool is_less(const CompositeKeyResult& x,const T2& y) in is_less() function
253 static bool is_less(const CompositeKeyResult& x,const T2& y) in is_less() function
271 static bool is_less(const T1& x,const T2& y,const Compare& c) in is_less() function
289 static bool is_less( in is_less() function
|
| /external/cronet/tot/third_party/libc++/src/test/std/utilities/type.index/type.index.members/ |
| D | cmp.pass.cpp | 48 bool is_less = t1 < t3; in main() local
|
| /external/cronet/stable/third_party/libc++/src/test/std/utilities/type.index/type.index.members/ |
| D | cmp.pass.cpp | 48 bool is_less = t1 < t3; in main() local
|
| /external/zucchini/ |
| D | suffix_array_unittest.cc | 191 bool is_less = std::lexicographical_compare(suf1, end, suf2, end); in TestSuffixSort() local
264 bool is_less = std::lexicographical_compare(suf, end, search_str.begin(), in TestSuffixLowerBound() local
271 bool is_less = std::lexicographical_compare(suf, end, search_str.begin(), in TestSuffixLowerBound() local
|
| /external/llvm-libc/test/src/stdlib/ |
| D | heap_sort_test.cpp | 17 const auto is_less = [compare](const void *a, in heap_sort() local
|
| D | quick_sort_test.cpp | 16 const auto is_less = [compare](const void *a, in quick_sort() local
|
| /external/sdv/vsomeip/third_party/boost/date_time/include/boost/date_time/ |
| D | time_system_split.hpp | 150 bool is_less(const time_rep_type& lhs, const time_rep_type& rhs) in is_less() function in boost::date_time::split_timedate_system
|
| D | time_system_counted.hpp | 199 bool is_less(const time_rep_type& lhs, const time_rep_type& rhs) in is_less() function in boost::date_time::counted_time_system
|
| /external/rust/android-crates-io/crates/rayon/src/slice/ |
| D | mergesort.rs | 663 let is_less = &is_less; in par_mergesort() localVariable
|