Home
last modified time | relevance | path

Searched refs:is_sorted (Results 1 – 24 of 24) sorted by relevance

/external/libcxx/test/std/algorithms/alg.sorting/alg.sort/is.sorted/
Dis_sorted.pass.cpp29 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 …]
Dis_sorted_comp.pass.cpp30 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/libcxx/test/std/algorithms/alg.sorting/alg.sort/sort/
Dsort.pass.cpp34 assert(std::is_sorted(save, save+len)); in test_sort_helper()
90 assert(std::is_sorted(array, array+N)); in test_larger_sorts()
94 assert(std::is_sorted(array, array+N)); in test_larger_sorts()
97 assert(std::is_sorted(array, array+N)); in test_larger_sorts()
101 assert(std::is_sorted(array, array+N)); in test_larger_sorts()
105 assert(std::is_sorted(array, array+N)); in test_larger_sorts()
110 assert(std::is_sorted(array, array+N)); in test_larger_sorts()
Dsort_comp.pass.cpp42 assert(std::is_sorted(v.begin(), v.end())); in main()
51 assert(std::is_sorted(v.begin(), v.end(), indirect_less())); in main()
/external/libcxx/test/std/algorithms/alg.sorting/alg.sort/stable.sort/
Dstable_sort.pass.cpp34 assert(std::is_sorted(save, save+len)); in test_sort_helper()
90 assert(std::is_sorted(array, array+N)); in test_larger_sorts()
94 assert(std::is_sorted(array, array+N)); in test_larger_sorts()
97 assert(std::is_sorted(array, array+N)); in test_larger_sorts()
101 assert(std::is_sorted(array, array+N)); in test_larger_sorts()
105 assert(std::is_sorted(array, array+N)); in test_larger_sorts()
110 assert(std::is_sorted(array, array+N)); in test_larger_sorts()
Dstable_sort_comp.pass.cpp64 assert(std::is_sorted(v.begin(), v.end())); in test()
77 assert(std::is_sorted(v.begin(), v.end(), indirect_less())); in main()
/external/libcxx/test/std/algorithms/alg.sorting/alg.heap.operations/sort.heap/
Dsort_heap_comp.pass.cpp40 assert(std::is_sorted(ia, ia+N, std::greater<int>())); in test()
62 assert(std::is_sorted(ia, ia+N, indirect_less())); in main()
Dsort_heap.pass.cpp28 assert(std::is_sorted(ia, ia+N)); in test()
/external/libcxx/test/std/algorithms/alg.sorting/alg.merge/
Dinplace_merge_comp.pass.cpp53 assert(std::is_sorted(ia, ia+N, std::greater<int>())); in test_one()
111 assert(std::is_sorted(ia, ia+N, indirect_less())); in main()
Dinplace_merge.pass.cpp39 assert(std::is_sorted(ia, ia+N)); in test_one()
Dmerge.pass.cpp44 assert(std::is_sorted(ic, ic+2*N)); in test()
66 assert(std::is_sorted(ic, ic+2*N)); in test()
Dmerge_comp.pass.cpp51 assert(std::is_sorted(ic, ic+2*N, std::greater<int>())); in test()
75 assert(std::is_sorted(ic, ic+2*N, std::greater<int>())); in test()
/external/boringssl/src/crypto/x509/
Dx_crl.c482 const int is_sorted = sk_X509_REVOKED_is_sorted(crl->crl->revoked); in def_crl_lookup() local
485 if (!is_sorted) in def_crl_lookup()
/external/opencv/ml/src/
Dml_inner_functions.cpp467 int i, idx_total, idx_selected = 0, step, type, prev = INT_MIN, is_sorted = 1; in cvPreprocessIndexArray() local
516 is_sorted = 0; in cvPreprocessIndexArray()
541 if( !is_sorted ) in cvPreprocessIndexArray()
/external/llvm/tools/verify-uselistorder/
Dverify-uselistorder.cpp407 } while (std::is_sorted(V->use_begin(), V->use_end(), compareUses)); in shuffleValueUseLists()
/external/llvm/lib/Target/X86/
DX86IntrinsicsInfo.h619 assert(std::is_sorted(std::begin(IntrinsicsWithoutChain), in verifyIntrinsicTables()
621 std::is_sorted(std::begin(IntrinsicsWithChain), in verifyIntrinsicTables()
/external/llvm/lib/Bitcode/Writer/
DValueEnumerator.cpp194 if (std::is_sorted( in predictValueUseListOrderImpl()
/external/clang/www/
Dlibstdc++4.4-clang0x.patch490 // is_sorted, a predicated testing whether a range is sorted in
/external/libcxx/include/
Dalgorithm320 is_sorted(ForwardIterator first, ForwardIterator last);
324 is_sorted(ForwardIterator first, ForwardIterator last, Compare comp);
3585 // is_sorted
3590 is_sorted(_ForwardIterator __first, _ForwardIterator __last, _Compare __comp)
3598 is_sorted(_ForwardIterator __first, _ForwardIterator __last)
3600 …return _VSTD::is_sorted(__first, __last, __less<typename iterator_traits<_ForwardIterator>::value_…
/external/opencv/cxcore/src/
Dcxdatastructs.cpp2449 int is_sorted, int* _idx, void* userdata ) in cvSeqSearch() argument
2473 if( !is_sorted ) in cvSeqSearch()
/external/opencv/cxcore/include/
Dcxcore.h1092 int is_sorted, int* elem_idx,
/external/llvm/lib/CodeGen/AsmPrinter/
DDwarfDebug.cpp1522 assert(std::is_sorted(Values.begin(), Values.end()) && in finalize()
/external/llvm/lib/IR/
DAsmWriter.cpp182 if (std::is_sorted( in predictValueUseListOrderImpl()
/external/clang/lib/AST/
DASTContext.cpp69 assert(std::is_sorted(RawComments.begin(), RawComments.end(), in getRawCommentForDeclNoCache()