/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/libcxx/test/std/algorithms/alg.sorting/alg.sort/sort/ |
D | sort.pass.cpp | 34 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()
|
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/libcxx/test/std/algorithms/alg.sorting/alg.sort/stable.sort/ |
D | stable_sort.pass.cpp | 34 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()
|
D | stable_sort_comp.pass.cpp | 64 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/ |
D | sort_heap_comp.pass.cpp | 40 assert(std::is_sorted(ia, ia+N, std::greater<int>())); in test() 62 assert(std::is_sorted(ia, ia+N, indirect_less())); in main()
|
D | sort_heap.pass.cpp | 28 assert(std::is_sorted(ia, ia+N)); in test()
|
/external/libcxx/test/std/algorithms/alg.sorting/alg.merge/ |
D | inplace_merge_comp.pass.cpp | 53 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()
|
D | inplace_merge.pass.cpp | 39 assert(std::is_sorted(ia, ia+N)); in test_one()
|
D | merge.pass.cpp | 44 assert(std::is_sorted(ic, ic+2*N)); in test() 66 assert(std::is_sorted(ic, ic+2*N)); in test()
|
D | merge_comp.pass.cpp | 51 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/ |
D | x_crl.c | 482 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/ |
D | ml_inner_functions.cpp | 467 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/ |
D | verify-uselistorder.cpp | 407 } while (std::is_sorted(V->use_begin(), V->use_end(), compareUses)); in shuffleValueUseLists()
|
/external/llvm/lib/Target/X86/ |
D | X86IntrinsicsInfo.h | 619 assert(std::is_sorted(std::begin(IntrinsicsWithoutChain), in verifyIntrinsicTables() 621 std::is_sorted(std::begin(IntrinsicsWithChain), in verifyIntrinsicTables()
|
/external/llvm/lib/Bitcode/Writer/ |
D | ValueEnumerator.cpp | 194 if (std::is_sorted( in predictValueUseListOrderImpl()
|
/external/clang/www/ |
D | libstdc++4.4-clang0x.patch | 490 // is_sorted, a predicated testing whether a range is sorted in
|
/external/libcxx/include/ |
D | algorithm | 320 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/ |
D | cxdatastructs.cpp | 2449 int is_sorted, int* _idx, void* userdata ) in cvSeqSearch() argument 2473 if( !is_sorted ) in cvSeqSearch()
|
/external/opencv/cxcore/include/ |
D | cxcore.h | 1092 int is_sorted, int* elem_idx,
|
/external/llvm/lib/CodeGen/AsmPrinter/ |
D | DwarfDebug.cpp | 1522 assert(std::is_sorted(Values.begin(), Values.end()) && in finalize()
|
/external/llvm/lib/IR/ |
D | AsmWriter.cpp | 182 if (std::is_sorted( in predictValueUseListOrderImpl()
|
/external/clang/lib/AST/ |
D | ASTContext.cpp | 69 assert(std::is_sorted(RawComments.begin(), RawComments.end(), in getRawCommentForDeclNoCache()
|