/external/libcxx/test/std/algorithms/alg.sorting/alg.sort/is.sorted/ |
D | is_sorted.pass.cpp | 26 return std::is_sorted(std::begin(ia), std::end(ia)) in test_constexpr() 27 && !std::is_sorted(std::begin(ib), std::end(ib)); in test_constexpr() 38 assert(std::is_sorted(Iter(a), Iter(a))); in test() 39 assert(std::is_sorted(Iter(a), Iter(a+sa))); in test() 45 assert(std::is_sorted(Iter(a), Iter(a+sa))); in test() 50 assert(std::is_sorted(Iter(a), Iter(a+sa))); in test() 55 assert(!std::is_sorted(Iter(a), Iter(a+sa))); in test() 60 assert(std::is_sorted(Iter(a), Iter(a+sa))); in test() 66 assert(std::is_sorted(Iter(a), Iter(a+sa))); in test() 71 assert(std::is_sorted(Iter(a), Iter(a+sa))); in test() [all …]
|
D | is_sorted_comp.pass.cpp | 27 return std::is_sorted(std::begin(ia), std::end(ia), std::greater<int>()) in test_constexpr() 28 && !std::is_sorted(std::begin(ib), std::end(ib), std::greater<int>()); in test_constexpr() 39 assert(std::is_sorted(Iter(a), Iter(a))); in test() 40 assert(std::is_sorted(Iter(a), Iter(a+sa), std::greater<int>())); in test() 46 assert(std::is_sorted(Iter(a), Iter(a+sa), std::greater<int>())); in test() 51 assert(!std::is_sorted(Iter(a), Iter(a+sa), std::greater<int>())); in test() 56 assert(std::is_sorted(Iter(a), Iter(a+sa), std::greater<int>())); in test() 61 assert(std::is_sorted(Iter(a), Iter(a+sa), std::greater<int>())); in test() 67 assert(std::is_sorted(Iter(a), Iter(a+sa), std::greater<int>())); in test() 72 assert(!std::is_sorted(Iter(a), Iter(a+sa), std::greater<int>())); in test() [all …]
|
/external/eigen/test/ |
D | sparse_permutations.cpp | 23 bool is_sorted(const T& mat) { in is_sorted() function 79 VERIFY( is_sorted( ::eval(mat*p) )); in sparse_permutations() 80 VERIFY( is_sorted( res = mat*p )); in sparse_permutations() 86 VERIFY( is_sorted( ::eval(p*mat) )); in sparse_permutations() 87 VERIFY( is_sorted( res = p*mat )); in sparse_permutations() 92 VERIFY( is_sorted( (mat*p).eval() )); in sparse_permutations() 93 VERIFY( is_sorted( res = mat*p.inverse() )); in sparse_permutations() 98 VERIFY( is_sorted( (p*mat+p*mat).eval() )); in sparse_permutations() 99 VERIFY( is_sorted( res = p.inverse()*mat )); in sparse_permutations() 104 VERIFY( is_sorted( (p * mat * p.inverse()).eval() )); in sparse_permutations() [all …]
|
/external/libcxx/test/std/algorithms/alg.sorting/alg.sort/stable.sort/ |
D | stable_sort.pass.cpp | 40 assert(std::is_sorted(save, save+len)); in test_sort_helper() 96 assert(std::is_sorted(array, array+N)); in test_larger_sorts() 100 assert(std::is_sorted(array, array+N)); in test_larger_sorts() 103 assert(std::is_sorted(array, array+N)); in test_larger_sorts() 107 assert(std::is_sorted(array, array+N)); in test_larger_sorts() 111 assert(std::is_sorted(array, array+N)); in test_larger_sorts() 116 assert(std::is_sorted(array, array+N)); in test_larger_sorts()
|
D | stable_sort_comp.pass.cpp | 67 assert(std::is_sorted(v.begin(), v.end())); in test() 80 assert(std::is_sorted(v.begin(), v.end(), indirect_less())); in main()
|
/external/libcxx/test/std/algorithms/alg.sorting/alg.sort/sort/ |
D | sort.pass.cpp | 40 assert(std::is_sorted(save, save+len)); in test_sort_helper() 96 assert(std::is_sorted(array, array+N)); in test_larger_sorts() 100 assert(std::is_sorted(array, array+N)); in test_larger_sorts() 103 assert(std::is_sorted(array, array+N)); in test_larger_sorts() 107 assert(std::is_sorted(array, array+N)); in test_larger_sorts() 111 assert(std::is_sorted(array, array+N)); in test_larger_sorts() 116 assert(std::is_sorted(array, array+N)); in test_larger_sorts()
|
D | sort_comp.pass.cpp | 42 assert(std::is_sorted(v.begin(), v.end())); in main() 51 assert(std::is_sorted(v.begin(), v.end(), indirect_less())); in main()
|
/external/perfetto/src/base/ |
D | circular_queue_unittest.cc | 99 ASSERT_FALSE(std::is_sorted(queue.begin(), queue.end())); in TEST() 101 ASSERT_TRUE(std::is_sorted(queue.begin(), queue.end())); in TEST() 158 ASSERT_TRUE(std::is_sorted(begin, end)); in TEST() 171 ASSERT_TRUE(std::is_sorted(begin, mid)); in TEST() 172 ASSERT_TRUE(std::is_sorted(mid, end)); in TEST() 278 ASSERT_TRUE(std::is_sorted(q1.begin(), q1.end(), comparer)); in TEST() 279 ASSERT_TRUE(std::is_sorted(q2.begin(), q2.end(), comparer)); in TEST()
|
/external/swiftshader/third_party/llvm-7.0/llvm/unittests/ADT/ |
D | SimpleIListTest.cpp | 440 EXPECT_TRUE(std::is_sorted(L1.begin(), L1.end())); in TEST() 441 EXPECT_TRUE(std::is_sorted(L2.begin(), L2.end())); in TEST() 449 EXPECT_TRUE(std::is_sorted(LHS.begin(), LHS.end())); in TEST() 477 EXPECT_TRUE(std::is_sorted(L1.begin(), L1.end(), makeFalse)); in TEST() 478 EXPECT_TRUE(std::is_sorted(L2.begin(), L2.end(), makeFalse)); in TEST() 486 EXPECT_TRUE(std::is_sorted(L1.begin(), L1.end(), makeFalse)); in TEST() 501 EXPECT_TRUE(std::is_sorted(L2.begin(), L2.end(), makeFalse)); in TEST() 525 EXPECT_TRUE(std::is_sorted(L1.begin(), L1.end())); in TEST() 533 EXPECT_TRUE(std::is_sorted(LHS.begin(), LHS.end())); in TEST() 558 EXPECT_FALSE(std::is_sorted(L.begin(), L.end())); in TEST() [all …]
|
/external/libcxx/fuzzing/ |
D | fuzzing.cpp | 169 if (!std::is_sorted(working.begin(), working.end())) return 1; in sort() 184 if (!std::is_sorted(working.begin(), working.end(), key_less())) return 1; in stable_sort() 189 if (!std::is_sorted(range.first, range.second, total_less())) return 2; in stable_sort() 258 if (!std::is_sorted(working.begin(), iter, payload_less())) return 3; in stable_partition() 259 if (!std::is_sorted(iter, working.end(), payload_less())) return 4; in stable_partition() 310 if (!std::is_sorted(working.begin(), sort_iter)) return 3; in partial_sort() 327 if (!std::is_sorted(results.begin(), results.end())) return 1; in partial_sort_copy() 385 if (!std::is_sorted(results.begin(), new_end)) return 2; in unique() 425 if (!std::is_sorted(results.begin(), results.end())) return 2; in unique_copy()
|
/external/libcxx/test/std/algorithms/alg.sorting/alg.heap.operations/sort.heap/ |
D | sort_heap_comp.pass.cpp | 42 assert(std::is_sorted(ia, ia+N, std::greater<int>())); in test() 64 assert(std::is_sorted(ia, ia+N, indirect_less())); in main()
|
D | sort_heap.pass.cpp | 31 assert(std::is_sorted(ia, ia+N)); in test()
|
/external/swiftshader/third_party/llvm-7.0/llvm/unittests/IR/ |
D | ModuleTest.cpp | 45 EXPECT_FALSE(std::is_sorted(M.global_begin(), M.global_end(), compare)); in TEST() 47 EXPECT_TRUE(std::is_sorted(M.global_begin(), M.global_end(), compare)); in TEST()
|
/external/swiftshader/third_party/llvm-7.0/llvm/lib/Target/X86/ |
D | X86InstrFMA3Info.cpp | 120 assert(std::is_sorted(std::begin(Groups), std::end(Groups)) && in verifyTables() 121 std::is_sorted(std::begin(RoundGroups), std::end(RoundGroups)) && in verifyTables() 122 std::is_sorted(std::begin(BroadcastGroups), in verifyTables()
|
D | X86EvexToVex.cpp | 243 assert(std::is_sorted(std::begin(X86EvexToVex128CompressTable), in CompressEvexToVexImpl() 246 assert(std::is_sorted(std::begin(X86EvexToVex256CompressTable), in CompressEvexToVexImpl()
|
/external/perfetto/src/trace_processor/ |
D | trace_sorter.cc | 46 PERFETTO_DCHECK(std::is_sorted(events_.begin(), sort_end)); in Sort() 54 PERFETTO_DCHECK(std::is_sorted(events_.begin(), events_.end())); in Sort()
|
/external/libcxx/test/std/algorithms/alg.sorting/alg.merge/ |
D | inplace_merge_comp.pass.cpp | 82 assert(std::is_sorted(ia, ia+N, std::greater<value_type>())); in test_one() 164 assert(std::is_sorted(ia, ia+N, indirect_less())); in main()
|
D | merge.pass.cpp | 64 assert(std::is_sorted(ic, ic+2*N)); in test() 86 assert(std::is_sorted(ic, ic+2*N)); in test()
|
D | merge_comp.pass.cpp | 72 assert(std::is_sorted(ic, ic+2*N, std::greater<int>())); in test() 96 assert(std::is_sorted(ic, ic+2*N, std::greater<int>())); in test()
|
/external/llvm/lib/MC/ |
D | SubtargetFeature.cpp | 232 assert(std::is_sorted(std::begin(CPUTable), std::end(CPUTable)) && in getFeatureBits() 234 assert(std::is_sorted(std::begin(FeatureTable), std::end(FeatureTable)) && in getFeatureBits()
|
/external/swiftshader/third_party/llvm-7.0/llvm/lib/MC/ |
D | SubtargetFeature.cpp | 211 assert(std::is_sorted(std::begin(CPUTable), std::end(CPUTable)) && in getFeatureBits() 213 assert(std::is_sorted(std::begin(FeatureTable), std::end(FeatureTable)) && in getFeatureBits()
|
/external/libcxx/test/std/algorithms/alg.modifying.operations/alg.random.sample/ |
D | sample.stable.pass.cpp | 47 unstable |= !std::is_sorted(oa, oa + kSampleSize); in test_stability()
|
/external/swiftshader/third_party/llvm-7.0/llvm/unittests/Support/ |
D | ParallelTest.cpp | 35 ASSERT_TRUE(std::is_sorted(std::begin(array), std::end(array))); in TEST()
|
/external/tensorflow/tensorflow/compiler/tf2xla/kernels/ |
D | bucketize_op.cc | 31 OP_REQUIRES(context, std::is_sorted(boundaries_.begin(), boundaries_.end()), in BucketizeOp()
|
/external/tensorflow/tensorflow/core/kernels/ |
D | bucketize_op.cc | 58 OP_REQUIRES(context, std::is_sorted(boundaries_.begin(), boundaries_.end()), in BucketizeOp()
|