/external/libcxx/test/algorithms/alg.nonmodifying/mismatch/ |
H A D | mismatch.pass.cpp | 28 int ia[] = {0, 1, 2, 2, 0, 1, 2, 3}; local 29 const unsigned sa = sizeof(ia)/sizeof(ia[0]); 31 assert(std::mismatch(input_iterator<const int*>(ia), 32 input_iterator<const int*>(ia + sa), 36 input_iterator<const int*>(ia+3), 40 assert(std::mismatch(input_iterator<const int*>(ia), 41 input_iterator<const int*>(ia + sa), 46 input_iterator<const int*>(ia+3), 49 assert(std::mismatch(input_iterator<const int*>(ia), [all...] |
H A D | mismatch_pred.pass.cpp | 31 int ia[] = {0, 1, 2, 2, 0, 1, 2, 3}; local 32 const unsigned sa = sizeof(ia)/sizeof(ia[0]); 34 assert(std::mismatch(input_iterator<const int*>(ia), 35 input_iterator<const int*>(ia + sa), 40 input_iterator<const int*>(ia+3), 43 assert(std::mismatch(input_iterator<const int*>(ia), 44 input_iterator<const int*>(ia + sa), 50 input_iterator<const int*>(ia+3), 54 assert(std::mismatch(ia, i [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...] |
/external/libcxx/test/numerics/numeric.ops/numeric.iota/ |
H A D | iota.pass.cpp | 24 int ia[] = {1, 2, 3, 4, 5}; local 26 const unsigned s = sizeof(ia) / sizeof(ia[0]); 27 std::iota(InIter(ia), InIter(ia+s), 5); 29 assert(ia[i] == ir[i]);
|
/external/libcxx/test/algorithms/alg.modifying.operations/alg.copy/ |
H A D | copy.pass.cpp | 26 int ia[N]; local 28 ia[i] = i; 31 OutIter r = std::copy(InIter(ia), InIter(ia+N), OutIter(ib)); 34 assert(ia[i] == ib[i]);
|
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]);
|
H A D | copy_n.pass.cpp | 26 int ia[N]; local 28 ia[i] = i; 31 OutIter r = std::copy_n(InIter(ia), N/2, OutIter(ib)); 34 assert(ia[i] == ib[i]);
|
/external/libcxx/test/algorithms/alg.modifying.operations/alg.fill/ |
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.modifying.operations/alg.generate/ |
H A D | generate.pass.cpp | 33 int ia[n] = {0}; local 34 std::generate(Iter(ia), Iter(ia+n), gen_test()); 35 assert(ia[0] == 1); 36 assert(ia[1] == 1); 37 assert(ia[2] == 1); 38 assert(ia[3] == 1);
|
H A D | generate_n.pass.cpp | 33 int ia[n] = {0}; local 34 assert(std::generate_n(Iter(ia), n, gen_test()) == Iter(ia+n)); 35 assert(ia[0] == 2); 36 assert(ia[1] == 2); 37 assert(ia[2] == 2); 38 assert(ia[3] == 2);
|
/external/libcxx/test/algorithms/alg.modifying.operations/alg.move/ |
H A D | move.pass.cpp | 30 int ia[N]; local 32 ia[i] = i; 35 OutIter r = std::move(InIter(ia), InIter(ia+N), OutIter(ib)); 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(InIter(ia), InIter(ia+N), OutIter(ib));
|
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));
|
/external/libcxx/test/algorithms/alg.modifying.operations/alg.random.shuffle/ |
H A D | random_shuffle_urng.pass.cpp | 22 int ia[] = {1, 2, 3, 4, 5, 6, 7, 8, 9, 10}; local 25 const unsigned sa = sizeof(ia)/sizeof(ia[0]); 27 std::shuffle(ia, ia+sa, g); 28 assert(std::equal(ia, ia+sa, ia1)); 29 std::shuffle(ia, ia+sa, g); 30 assert(std::equal(ia, i [all...] |
/external/libcxx/test/algorithms/alg.modifying.operations/alg.remove/ |
H A D | remove.pass.cpp | 30 int ia[] = {0, 1, 2, 3, 4, 2, 3, 4, 2}; local 31 const unsigned sa = sizeof(ia)/sizeof(ia[0]); 32 Iter r = std::remove(Iter(ia), Iter(ia+sa), 2); 33 assert(base(r) == ia + sa-3); 34 assert(ia[0] == 0); 35 assert(ia[1] == 1); 36 assert(ia[2] == 3); 37 assert(ia[ 49 std::unique_ptr<int> ia[sa]; local [all...] |
H A D | remove_copy.pass.cpp | 26 int ia[] = {0, 1, 2, 3, 4, 2, 3, 4, 2}; local 27 const unsigned sa = sizeof(ia)/sizeof(ia[0]); 29 OutIter r = std::remove_copy(InIter(ia), InIter(ia+sa), OutIter(ib), 2);
|
H A D | remove_copy_if.pass.cpp | 28 int ia[] = {0, 1, 2, 3, 4, 2, 3, 4, 2}; local 29 const unsigned sa = sizeof(ia)/sizeof(ia[0]); 31 OutIter r = std::remove_copy_if(InIter(ia), InIter(ia+sa), OutIter(ib),
|
/external/libcxx/test/algorithms/alg.modifying.operations/alg.replace/ |
H A D | replace_copy.pass.cpp | 29 int ia[] = {0, 1, 2, 3, 4}; local 30 const unsigned sa = sizeof(ia)/sizeof(ia[0]); 32 OutIter r = std::replace_copy(InIter(ia), InIter(ia+sa), OutIter(ib), 2, 5);
|
H A D | replace_copy_if.pass.cpp | 30 int ia[] = {0, 1, 2, 3, 4}; local 31 const unsigned sa = sizeof(ia)/sizeof(ia[0]); 33 OutIter r = std::replace_copy_if(InIter(ia), InIter(ia+sa), OutIter(ib),
|
/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.transform/ |
H A D | binary_transform.pass.cpp | 28 int ia[] = {0, 1, 2, 3, 4}; local 29 const unsigned sa = sizeof(ia)/sizeof(ia[0]); 31 OutIter r = std::transform(InIter1(ib), InIter1(ib+sa), InIter2(ia),
|
H A D | unary_transform.pass.cpp | 28 int ia[] = {0, 1, 2, 3, 4}; local 29 const unsigned sa = sizeof(ia)/sizeof(ia[0]); 31 OutIter r = std::transform(InIter(ia), InIter(ia+sa), OutIter(ib),
|
/external/libcxx/test/algorithms/alg.nonmodifying/alg.all_of/ |
H A D | all_of.pass.cpp | 32 int ia[] = {2, 4, 6, 8}; local 33 const unsigned sa = sizeof(ia)/sizeof(ia[0]); 34 assert(std::all_of(input_iterator<const int*>(ia), 35 input_iterator<const int*>(ia + sa), test1()) == true); 36 assert(std::all_of(input_iterator<const int*>(ia), 37 input_iterator<const int*>(ia), test1()) == true); 40 const int ia[] = {2, 4, 5, 8}; local 41 const unsigned sa = sizeof(ia)/sizeof(ia[ [all...] |
/external/libcxx/test/algorithms/alg.nonmodifying/alg.any_of/ |
H A D | any_of.pass.cpp | 32 int ia[] = {2, 4, 6, 8}; local 33 const unsigned sa = sizeof(ia)/sizeof(ia[0]); 34 assert(std::any_of(input_iterator<const int*>(ia), 35 input_iterator<const int*>(ia + sa), test1()) == true); 36 assert(std::any_of(input_iterator<const int*>(ia), 37 input_iterator<const int*>(ia), test1()) == false); 40 const int ia[] = {2, 4, 5, 8}; local 41 const unsigned sa = sizeof(ia)/sizeof(ia[ 48 const int ia[] = {1, 3, 5, 7}; local [all...] |
/external/libcxx/test/algorithms/alg.nonmodifying/alg.find.first.of/ |
H A D | find_first_of.pass.cpp | 24 int ia[] = {0, 1, 2, 3, 0, 1, 2, 3}; local 25 const unsigned sa = sizeof(ia)/sizeof(ia[0]); 28 assert(std::find_first_of(input_iterator<const int*>(ia), 29 input_iterator<const int*>(ia + sa), 32 input_iterator<const int*>(ia+1)); 34 assert(std::find_first_of(input_iterator<const int*>(ia), 35 input_iterator<const int*>(ia + sa), 38 input_iterator<const int*>(ia+sa)); 39 assert(std::find_first_of(input_iterator<const int*>(ia), [all...] |
H A D | find_first_of_pred.pass.cpp | 26 int ia[] = {0, 1, 2, 3, 0, 1, 2, 3}; local 27 const unsigned sa = sizeof(ia)/sizeof(ia[0]); 30 assert(std::find_first_of(input_iterator<const int*>(ia), 31 input_iterator<const int*>(ia + sa), 35 input_iterator<const int*>(ia+1)); 37 assert(std::find_first_of(input_iterator<const int*>(ia), 38 input_iterator<const int*>(ia + sa), 42 input_iterator<const int*>(ia+sa)); 43 assert(std::find_first_of(input_iterator<const int*>(ia), [all...] |