| /external/libcxx/test/std/algorithms/alg.sorting/alg.sort/is.sorted/ |
| D | is_sorted.pass.cpp | 29 assert(std::is_sorted(Iter(a), Iter(a))); in test()
30 assert(std::is_sorted(Iter(a), Iter(a+sa))); in test()
36 assert(std::is_sorted(Iter(a), Iter(a+sa))); in test()
41 assert(std::is_sorted(Iter(a), Iter(a+sa))); in test()
46 assert(!std::is_sorted(Iter(a), Iter(a+sa))); in test()
51 assert(std::is_sorted(Iter(a), Iter(a+sa))); in test()
57 assert(std::is_sorted(Iter(a), Iter(a+sa))); in test()
62 assert(std::is_sorted(Iter(a), Iter(a+sa))); in test()
67 assert(!std::is_sorted(Iter(a), Iter(a+sa))); in test()
72 assert(std::is_sorted(Iter(a), Iter(a+sa))); in test()
[all …]
|
| D | is_sorted_comp.pass.cpp | 30 assert(std::is_sorted(Iter(a), Iter(a))); in test()
31 assert(std::is_sorted(Iter(a), Iter(a+sa), std::greater<int>())); in test()
37 assert(std::is_sorted(Iter(a), Iter(a+sa), std::greater<int>())); in test()
42 assert(!std::is_sorted(Iter(a), Iter(a+sa), std::greater<int>())); in test()
47 assert(std::is_sorted(Iter(a), Iter(a+sa), std::greater<int>())); in test()
52 assert(std::is_sorted(Iter(a), Iter(a+sa), std::greater<int>())); in test()
58 assert(std::is_sorted(Iter(a), Iter(a+sa), std::greater<int>())); in test()
63 assert(!std::is_sorted(Iter(a), Iter(a+sa), std::greater<int>())); in test()
68 assert(!std::is_sorted(Iter(a), Iter(a+sa), std::greater<int>())); in test()
73 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/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 | 43 assert(std::is_sorted(v.begin(), v.end())); in main()
52 assert(std::is_sorted(v.begin(), v.end(), indirect_less())); in main()
|
| /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 | 68 assert(std::is_sorted(v.begin(), v.end())); in test()
81 assert(std::is_sorted(v.begin(), v.end(), indirect_less())); in main()
|
| /external/libcxx/test/std/algorithms/alg.sorting/alg.heap.operations/sort.heap/ |
| D | sort_heap_comp.pass.cpp | 43 assert(std::is_sorted(ia, ia+N, std::greater<int>())); in test()
65 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/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()
144 assert(std::is_sorted(ia, ia+N, indirect_less())); in main()
|
| D | merge.pass.cpp | 47 assert(std::is_sorted(ic, ic+2*N)); in test()
69 assert(std::is_sorted(ic, ic+2*N)); in test()
|
| D | merge_comp.pass.cpp | 54 assert(std::is_sorted(ic, ic+2*N, std::greater<int>())); in test()
78 assert(std::is_sorted(ic, ic+2*N, std::greater<int>())); in test()
|
| D | inplace_merge.pass.cpp | 65 assert(std::is_sorted(ia, ia+N)); in test_one()
|
| /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/libcxx/test/std/experimental/algorithms/alg.random.sample/ |
| D | sample.stable.pass.cpp | 45 unstable |= !std::is_sorted(oa, oa + kSampleSize); in test_stability()
|
| /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()
|
| D | MCSubtargetInfo.cpp | 80 assert(std::is_sorted(SchedModels.begin(), SchedModels.end(), in getSchedModelForCPU()
|
| /external/llvm/lib/Target/Mips/ |
| D | MipsCCState.cpp | 34 assert(std::is_sorted(std::begin(LibCalls), std::end(LibCalls), Comp)); in isF128SoftLibCall()
|
| /external/boringssl/src/crypto/x509/ |
| D | x_crl.c | 464 const int is_sorted = sk_X509_REVOKED_is_sorted(crl->crl->revoked); in def_crl_lookup() local
467 if (!is_sorted) { in def_crl_lookup()
|
| /external/clang/lib/Format/ |
| D | SortJavaScriptImports.cpp | 150 bool ReferencesInOrder = std::is_sorted(Indices.begin(), Indices.end()); in analyze()
|
| /external/clang/lib/Basic/ |
| D | DiagnosticIDs.cpp | 103 assert(std::is_sorted(std::begin(StaticDiagInfo), in GetDiagInfo()
|
| /external/llvm/tools/verify-uselistorder/ |
| D | verify-uselistorder.cpp | 414 } while (std::is_sorted(V->use_begin(), V->use_end(), compareUses)); in shuffleValueUseLists()
|
| /external/clang/www/ |
| D | libstdc++4.4-clang0x.patch | 490 // is_sorted, a predicated testing whether a range is sorted in
|
| /external/llvm/lib/Bitcode/Writer/ |
| D | ValueEnumerator.cpp | 196 if (std::is_sorted( in predictValueUseListOrderImpl()
|
| /external/llvm/lib/Analysis/ |
| D | MemoryDependenceAnalysis.cpp | 741 assert(std::is_sorted(Cache.begin(), Cache.begin() + Count) && in AssertSorted()
|