| /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/libgdx/extensions/gdx-bullet/jni/src/bullet/BulletCollision/Gimpact/ |
| D | gim_hash_table.h | 616 inline bool is_sorted() in is_sorted() function
624 if(is_sorted()) return true; in sort()
773 if(is_sorted()) in erase_by_index()
821 if(is_sorted()==false) return false; in erase_by_key()
857 if(this->is_sorted()) in insert()
875 if(this->is_sorted()) in insert_override()
|
| /external/libcxx/test/std/algorithms/alg.sorting/alg.merge/ |
| D | inplace_merge_comp.pass.cpp | 79 assert(std::is_sorted(ia, ia+N, std::greater<value_type>())); in test_one()
141 assert(std::is_sorted(ia, ia+N, indirect_less())); in main()
|
| 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()
|
| D | inplace_merge.pass.cpp | 62 assert(std::is_sorted(ia, ia+N)); in test_one()
|
| /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 | MCSubtargetInfo.cpp | 81 assert(std::is_sorted(ProcSchedModels, ProcSchedModels+NumProcs, 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 | 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/opencv3/apps/traincascade/ |
| D | old_ml_inner_functions.cpp | 400 int i, idx_total, idx_selected = 0, step, type, prev = INT_MIN, is_sorted = 1; in cvPreprocessIndexArray() local
447 is_sorted = 0; in cvPreprocessIndexArray()
472 if( !is_sorted ) in cvPreprocessIndexArray()
|
| D | boost.cpp | 124 int i, idx_total, idx_selected = 0, step, type, prev = INT_MIN, is_sorted = 1; in cvPreprocessIndexArray() local
171 is_sorted = 0; in cvPreprocessIndexArray()
196 if( !is_sorted ) in cvPreprocessIndexArray()
|
| /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/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 | 410 } while (std::is_sorted(V->use_begin(), V->use_end(), compareUses)); in shuffleValueUseLists()
|
| /external/llvm/lib/Bitcode/Writer/ |
| D | ValueEnumerator.cpp | 191 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);
3578 // is_sorted
3583 is_sorted(_ForwardIterator __first, _ForwardIterator __last, _Compare __comp)
3591 is_sorted(_ForwardIterator __first, _ForwardIterator __last)
3593 …return _VSTD::is_sorted(__first, __last, __less<typename iterator_traits<_ForwardIterator>::value_…
|