/external/libcxx/test/algorithms/alg.sorting/alg.merge/ |
H A D | inplace_merge_comp.pass.cpp | 40 int* ia = new int[N]; local 42 ia[i] = i; 43 std::random_shuffle(ia, ia+N); 44 std::sort(ia, ia+M, std::greater<int>()); 45 std::sort(ia+M, ia+N, std::greater<int>()); 46 std::inplace_merge(Iter(ia), Iter(ia 96 std::unique_ptr<int>* ia = new std::unique_ptr<int>[N]; local [all...] |
H A D | inplace_merge.pass.cpp | 28 int* ia = new int[N]; local 30 ia[i] = i; 31 std::random_shuffle(ia, ia+N); 32 std::sort(ia, ia+M); 33 std::sort(ia+M, ia+N); 34 std::inplace_merge(Iter(ia), Iter(ia [all...] |
/external/libcxx/test/algorithms/alg.sorting/alg.permutation.generators/ |
H A D | next_permutation.pass.cpp | 37 int ia[] = {1, 2, 3, 4, 5, 6}; local 38 const int sa = sizeof(ia)/sizeof(ia[0]); 46 std::copy(ia, ia+e, prev); 47 x = std::next_permutation(Iter(ia), Iter(ia+e)); 51 assert(std::lexicographical_compare(prev, prev+e, ia, ia+e)); 53 assert(std::lexicographical_compare(ia, i [all...] |
H A D | next_permutation_comp.pass.cpp | 39 int ia[] = {6, 5, 4, 3, 2, 1}; local 40 const int sa = sizeof(ia)/sizeof(ia[0]); 48 std::copy(ia, ia+e, prev); 49 x = std::next_permutation(Iter(ia), Iter(ia+e), C()); 53 assert(std::lexicographical_compare(prev, prev+e, ia, ia+e, C())); 55 assert(std::lexicographical_compare(ia, i [all...] |
H A D | prev_permutation.pass.cpp | 37 int ia[] = {6, 5, 4, 3, 2, 1}; local 38 const int sa = sizeof(ia)/sizeof(ia[0]); 46 std::copy(ia, ia+e, prev); 47 x = std::prev_permutation(Iter(ia), Iter(ia+e)); 51 assert(std::lexicographical_compare(ia, ia+e, prev, prev+e)); 53 assert(std::lexicographical_compare(prev, prev+e, ia, i [all...] |
H A D | prev_permutation_comp.pass.cpp | 39 int ia[] = {1, 2, 3, 4, 5, 6}; local 40 const int sa = sizeof(ia)/sizeof(ia[0]); 48 std::copy(ia, ia+e, prev); 49 x = std::prev_permutation(Iter(ia), Iter(ia+e), C()); 53 assert(std::lexicographical_compare(ia, ia+e, prev, prev+e, C())); 55 assert(std::lexicographical_compare(prev, prev+e, ia, i [all...] |
/external/libcxx/test/algorithms/alg.nonmodifying/alg.find.end/ |
H A D | find_end.pass.cpp | 26 int ia[] = {0, 1, 2, 3, 4, 5, 0, 1, 2, 3, 4, 0, 1, 2, 3, 0, 1, 2, 0, 1, 0}; local 27 const unsigned sa = sizeof(ia)/sizeof(ia[0]); 29 assert(std::find_end(Iter1(ia), Iter1(ia+sa), Iter2(b), Iter2(b+1)) == Iter1(ia+sa-1)); 31 assert(std::find_end(Iter1(ia), Iter1(ia+sa), Iter2(c), Iter2(c+2)) == Iter1(ia+18)); 33 assert(std::find_end(Iter1(ia), Iter [all...] |
H A D | find_end_pred.pass.cpp | 37 int ia[] = {0, 1, 2, 3, 4, 5, 0, 1, 2, 3, 4, 0, 1, 2, 3, 0, 1, 2, 0, 1, 0}; local 38 const unsigned sa = sizeof(ia)/sizeof(ia[0]); 41 assert(std::find_end(Iter1(ia), Iter1(ia+sa), Iter2(b), Iter2(b+1), count_equal()) == Iter1(ia+sa-1)); 45 assert(std::find_end(Iter1(ia), Iter1(ia+sa), Iter2(c), Iter2(c+2), count_equal()) == Iter1(ia+18)); 49 assert(std::find_end(Iter1(ia), Iter [all...] |
/external/libcxx/test/numerics/numarray/template.indirect.array/ |
H A D | default.fail.cpp | 21 std::indirect_array<int> ia; local
|
/external/libcxx/test/algorithms/alg.nonmodifying/alg.search/ |
H A D | search_pred.pass.cpp | 36 int ia[] = {0, 1, 2, 3, 4, 5}; local 37 const unsigned sa = sizeof(ia)/sizeof(ia[0]); 39 assert(std::search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia), count_equal()) == Iter1(ia)); 42 assert(std::search(Iter1(ia), Iter1(ia [all...] |
H A D | search_n.pass.cpp | 26 int ia[] = {0, 1, 2, 3, 4, 5}; local 27 const unsigned sa = sizeof(ia)/sizeof(ia[0]); 28 assert(std::search_n(Iter(ia), Iter(ia+sa), 0, 0) == Iter(ia)); 29 assert(std::search_n(Iter(ia), Iter(ia+sa), 1, 0) == Iter(ia+0)); 30 assert(std::search_n(Iter(ia), Ite [all...] |
H A D | search_n_pred.pass.cpp | 36 int ia[] = {0, 1, 2, 3, 4, 5}; local 37 const unsigned sa = sizeof(ia)/sizeof(ia[0]); 39 assert(std::search_n(Iter(ia), Iter(ia+sa), 0, 0, count_equal()) == Iter(ia)); 42 assert(std::search_n(Iter(ia), Iter(ia+sa), 1, 0, count_equal()) == Iter(ia+0)); 45 assert(std::search_n(Iter(ia), Ite [all...] |
/external/libcxx/test/algorithms/alg.sorting/alg.lex.comparison/ |
H A D | lexicographical_compare.pass.cpp | 27 int ia[] = {1, 2, 3, 4}; local 28 const unsigned sa = sizeof(ia)/sizeof(ia[0]); 30 assert(!std::lexicographical_compare(ia, ia+sa, ib, ib+2)); 31 assert(std::lexicographical_compare(ib, ib+2, ia, ia+sa)); 32 assert(!std::lexicographical_compare(ia, ia+sa, ib, ib+3)); 33 assert(std::lexicographical_compare(ib, ib+3, ia, i [all...] |
H A D | lexicographical_compare_comp.pass.cpp | 29 int ia[] = {1, 2, 3, 4}; local 30 const unsigned sa = sizeof(ia)/sizeof(ia[0]); 34 assert(!std::lexicographical_compare(ia, ia+sa, ib, ib+2, c)); 35 assert(std::lexicographical_compare(ib, ib+2, ia, ia+sa, c)); 36 assert(!std::lexicographical_compare(ia, ia+sa, ib, ib+3, c)); 37 assert(std::lexicographical_compare(ib, ib+3, ia, i [all...] |
/external/libcxx/test/algorithms/alg.modifying.operations/alg.rotate/ |
H A D | rotate_copy.pass.cpp | 25 int ia[] = {0, 1, 2, 3}; local 26 const unsigned sa = sizeof(ia)/sizeof(ia[0]); 29 OutIter r = std::rotate_copy(InIter(ia), InIter(ia), InIter(ia), OutIter(ib)); 32 r = std::rotate_copy(InIter(ia), InIter(ia), InIter(ia+1), OutIter(ib)); 36 r = std::rotate_copy(InIter(ia), InIte [all...] |
/external/libcxx/test/algorithms/alg.modifying.operations/alg.fill/ |
H A D | fill_n.pass.cpp | 40 int ia[n] = {0}; local 41 assert(std::fill_n(Iter(ia), n, 1) == std::next(Iter(ia), n)); 42 assert(ia[0] == 1); 43 assert(ia[1] == 1); 44 assert(ia[2] == 1); 45 assert(ia[3] == 1); 52 int ia[n] = {0}; local 53 assert(std::fill_n(ia, n, static_cast<char>(1)) == std::next(ia, 71 int ia[n] = {0}; local [all...] |
H A D | fill.pass.cpp | 40 int ia[n] = {0}; local 41 std::fill(Iter(ia), Iter(ia+n), 1); 42 assert(ia[0] == 1); 43 assert(ia[1] == 1); 44 assert(ia[2] == 1); 45 assert(ia[3] == 1);
|
/external/libcxx/test/algorithms/alg.sorting/alg.set.operations/includes/ |
H A D | includes.pass.cpp | 27 int ia[] = {1, 2, 2, 3, 3, 3, 4, 4, 4, 4}; local 28 const unsigned sa = sizeof(ia)/sizeof(ia[0]); 36 assert(std::includes(Iter1(ia), Iter1(ia), Iter2(ib), Iter2(ib))); 37 assert(!std::includes(Iter1(ia), Iter1(ia), Iter2(ib), Iter2(ib+1))); 38 assert(std::includes(Iter1(ia), Iter1(ia+1), Iter2(ib), Iter2(ib))); 39 assert(std::includes(Iter1(ia), Iter [all...] |
H A D | includes_comp.pass.cpp | 28 int ia[] = {1, 2, 2, 3, 3, 3, 4, 4, 4, 4}; local 29 const unsigned sa = sizeof(ia)/sizeof(ia[0]); 37 assert(std::includes(Iter1(ia), Iter1(ia), Iter2(ib), Iter2(ib), std::less<int>())); 38 assert(!std::includes(Iter1(ia), Iter1(ia), Iter2(ib), Iter2(ib+1), std::less<int>())); 39 assert(std::includes(Iter1(ia), Iter1(ia+1), Iter2(ib), Iter2(ib), std::less<int>())); 40 assert(std::includes(Iter1(ia), Iter [all...] |
/external/libcxx/test/algorithms/alg.modifying.operations/alg.reverse/ |
H A D | reverse.pass.cpp | 26 int ia[] = {0}; local 27 const unsigned sa = sizeof(ia)/sizeof(ia[0]); 28 std::reverse(Iter(ia), Iter(ia)); 29 assert(ia[0] == 0); 30 std::reverse(Iter(ia), Iter(ia+sa)); 31 assert(ia[0] == 0);
|
H A D | reverse_copy.pass.cpp | 25 const int ia[] = {0}; local 26 const unsigned sa = sizeof(ia)/sizeof(ia[0]); 28 OutIter r = std::reverse_copy(InIter(ia), InIter(ia), OutIter(ja)); 31 r = std::reverse_copy(InIter(ia), InIter(ia+sa), OutIter(ja));
|
/external/libcxx/test/algorithms/alg.modifying.operations/alg.copy/ |
H A D | copy_backward.pass.cpp | 27 int ia[N]; local 29 ia[i] = i; 32 OutIter r = std::copy_backward(InIter(ia), InIter(ia+N), OutIter(ib+N)); 35 assert(ia[i] == ib[i]);
|
/external/libcxx/test/algorithms/alg.modifying.operations/alg.partitions/ |
H A D | partition_copy.pass.cpp | 32 const int ia[] = {1, 2, 3, 4, 6, 8, 5, 7}; local 36 P p = std::partition_copy(input_iterator<const int*>(std::begin(ia)), 37 input_iterator<const int*>(std::end(ia)),
|
/external/sqlite/android/ |
H A D | OldPhoneNumberUtils.cpp | 197 int ia, ib; local 206 ia = strlen(a); 208 if (ia == 0 || ib == 0) { 213 ia--; 218 while (ia >= 0 && ib >=0) { 222 ca = a[ia]; 225 ia--; 242 ia--; ib--; matched++; 260 if (matched >= MIN_MATCH && (ia < 0 || ib < 0)) { 273 if (matchIntlPrefix(a, ia [all...] |
/external/libcxx/test/algorithms/alg.modifying.operations/alg.move/ |
H A D | move_backward.pass.cpp | 30 int ia[N]; local 32 ia[i] = i; 35 OutIter r = std::move_backward(InIter(ia), InIter(ia+N), OutIter(ib+N)); 38 assert(ia[i] == ib[i]); 48 std::unique_ptr<int> ia[N]; local 50 ia[i].reset(new int(i)); 53 OutIter r = std::move_backward(InIter(ia), InIter(ia+N), OutIter(ib+N));
|