/external/libcxx/test/iterators/stream.iterators/iterator.range/ |
H A D | end_array.pass.cpp | 19 int ia[] = {1, 2, 3}; local 20 int* i = std::begin(ia); 21 int* e = std::end(ia); 22 assert(e == ia + 3);
|
H A D | begin_non_const.pass.cpp | 19 int ia[] = {1, 2, 3}; local 20 std::vector<int> v(ia, ia + sizeof(ia)/sizeof(ia[0]));
|
H A D | end_const.pass.cpp | 19 int ia[] = {1, 2, 3}; local 20 const std::vector<int> v(ia, ia + sizeof(ia)/sizeof(ia[0]));
|
H A D | end_non_const.pass.cpp | 19 int ia[] = {1, 2, 3}; local 20 std::vector<int> v(ia, ia + sizeof(ia)/sizeof(ia[0]));
|
/external/libcxx/test/algorithms/alg.sorting/alg.heap.operations/sort.heap/ |
H A D | sort_heap.pass.cpp | 22 int* ia = new int [N]; local 24 ia[i] = i; 25 std::random_shuffle(ia, ia+N); 26 std::make_heap(ia, ia+N); 27 std::sort_heap(ia, ia+N); 28 assert(std::is_sorted(ia, ia [all...] |
H A D | sort_heap_comp.pass.cpp | 34 int* ia = new int [N]; local 36 ia[i] = i; 37 std::random_shuffle(ia, ia+N); 38 std::make_heap(ia, ia+N, std::greater<int>()); 39 std::sort_heap(ia, ia+N, std::greater<int>()); 40 assert(std::is_sorted(ia, ia 56 std::unique_ptr<int>* ia = new std::unique_ptr<int> [N]; local [all...] |
/external/libcxx/test/algorithms/alg.nonmodifying/alg.search/ |
H A D | search.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(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia)) == Iter1(ia)); 29 assert(std::search(Iter1(ia), Iter1(ia [all...] |
/external/libcxx/test/algorithms/alg.nonmodifying/alg.find/ |
H A D | find_if.pass.cpp | 25 int ia[] = {0, 1, 2, 3, 4, 5}; local 26 const unsigned s = sizeof(ia)/sizeof(ia[0]); 27 input_iterator<const int*> r = std::find_if(input_iterator<const int*>(ia), 28 input_iterator<const int*>(ia+s), 31 r = std::find_if(input_iterator<const int*>(ia), 32 input_iterator<const int*>(ia+s), 34 assert(r == input_iterator<const int*>(ia+s));
|
H A D | find_if_not.pass.cpp | 25 int ia[] = {0, 1, 2, 3, 4, 5}; local 26 const unsigned s = sizeof(ia)/sizeof(ia[0]); 27 input_iterator<const int*> r = std::find_if_not(input_iterator<const int*>(ia), 28 input_iterator<const int*>(ia+s), 31 r = std::find_if_not(input_iterator<const int*>(ia), 32 input_iterator<const int*>(ia+s), 34 assert(r == input_iterator<const int*>(ia+s));
|
/external/libcxx/test/algorithms/alg.sorting/alg.heap.operations/pop.heap/ |
H A D | pop_heap_comp.pass.cpp | 34 int* ia = new int [N]; local 36 ia[i] = i; 37 std::random_shuffle(ia, ia+N); 38 std::make_heap(ia, ia+N, std::greater<int>()); 41 std::pop_heap(ia, ia+i, std::greater<int>()); 42 assert(std::is_heap(ia, ia 55 std::unique_ptr<int>* ia = new std::unique_ptr<int> [N]; local [all...] |
/external/libcxx/test/algorithms/alg.modifying.operations/alg.partitions/ |
H A D | is_partitioned.pass.cpp | 29 const int ia[] = {1, 2, 3, 4, 5, 6}; local 30 assert(!std::is_partitioned(input_iterator<const int*>(std::begin(ia)), 31 input_iterator<const int*>(std::end(ia)), 35 const int ia[] = {1, 3, 5, 2, 4, 6}; local 36 assert( std::is_partitioned(input_iterator<const int*>(std::begin(ia)), 37 input_iterator<const int*>(std::end(ia)), 41 const int ia[] = {2, 4, 6, 1, 3, 5}; local 42 assert(!std::is_partitioned(input_iterator<const int*>(std::begin(ia)), 43 input_iterator<const int*>(std::end(ia)), 47 const int ia[] local 53 const int ia[] = {1, 3, 5, 2, 4, 6, 7}; local [all...] |
H A D | partition.pass.cpp | 36 int ia[] = {1, 2, 3, 4, 5, 6, 7, 8 ,9}; local 37 const unsigned sa = sizeof(ia)/sizeof(ia[0]); 38 Iter r = std::partition(Iter(ia), Iter(ia + sa), is_odd()); 39 assert(base(r) == ia + 5); 40 for (int* i = ia; i < base(r); ++i) 42 for (int* i = base(r); i < ia+sa; ++i) 45 r = std::partition(Iter(ia), Iter(ia), is_od [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...] |
/external/libcxx/test/algorithms/alg.modifying.operations/alg.generate/ |
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.nonmodifying/alg.equal/ |
H A D | equal_pred.pass.cpp | 37 int ia[] = {0, 1, 2, 3, 4, 5}; local 38 const unsigned s = sizeof(ia)/sizeof(ia[0]); 40 assert(std::equal(input_iterator<const int*>(ia), 41 input_iterator<const int*>(ia+s), 42 input_iterator<const int*>(ia), 45 assert(std::equal(input_iterator<const int*>(ia), 46 input_iterator<const int*>(ia+s), 47 input_iterator<const int*>(ia), 48 input_iterator<const int*>(ia [all...] |
/external/libcxx/test/algorithms/alg.nonmodifying/alg.count/ |
H A D | count_if.pass.cpp | 25 int ia[] = {0, 1, 2, 2, 0, 1, 2, 3}; local 26 const unsigned sa = sizeof(ia)/sizeof(ia[0]); 27 assert(std::count_if(input_iterator<const int*>(ia), 28 input_iterator<const int*>(ia + sa), 30 assert(std::count_if(input_iterator<const int*>(ia), 31 input_iterator<const int*>(ia + sa), 33 assert(std::count_if(input_iterator<const int*>(ia), 34 input_iterator<const int*>(ia),
|
/external/libcxx/test/numerics/numeric.ops/accumulate/ |
H A D | accumulate_op.pass.cpp | 36 int ia[] = {1, 2, 3, 4, 5, 6}; local 37 unsigned sa = sizeof(ia) / sizeof(ia[0]); 38 test(Iter(ia), Iter(ia), 1, 1); 39 test(Iter(ia), Iter(ia), 10, 10); 40 test(Iter(ia), Iter(ia+1), 1, 1); 41 test(Iter(ia), Ite [all...] |
/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.nonmodifying/alg.is_permutation/ |
H A D | is_permutation_pred.pass.cpp | 38 const int ia[] = {0}; local 40 const unsigned sa = sizeof(ia)/sizeof(ia[0]); 41 assert(std::is_permutation(forward_iterator<const int*>(ia), 42 forward_iterator<const int*>(ia + 0), 45 assert(std::is_permutation(forward_iterator<const int*>(ia), 46 forward_iterator<const int*>(ia + sa), 50 assert(std::is_permutation(forward_iterator<const int*>(ia), 51 forward_iterator<const int*>(ia + sa), 55 assert(std::is_permutation(forward_iterator<const int*>(ia), 63 const int ia[] = {0}; local 80 const int ia[] = {0, 0}; local 101 const int ia[] = {0, 0}; local 117 const int ia[] = {0, 0}; local 133 const int ia[] = {0, 0}; local 149 const int ia[] = {0, 1}; local 165 const int ia[] = {0, 1}; local 186 const int ia[] = {0, 1}; local 207 const int ia[] = {0, 1}; local 223 const int ia[] = {1, 0}; local 239 const int ia[] = {1, 0}; local 260 const int ia[] = {1, 0}; local 281 const int ia[] = {1, 0}; local 297 const int ia[] = {1, 1}; local 313 const int ia[] = {1, 1}; local 329 const int ia[] = {1, 1}; local 345 const int ia[] = {1, 1}; local 367 const int ia[] = {0, 0, 0}; local 383 const int ia[] = {0, 0, 0}; local 399 const int ia[] = {0, 0, 0}; local 415 const int ia[] = {0, 0, 0}; local 431 const int ia[] = {0, 0, 0}; local 447 const int ia[] = {0, 0, 0}; local 463 const int ia[] = {0, 0, 0}; local 479 const int ia[] = {0, 0, 0}; local 495 const int ia[] = {0, 0, 0}; local 511 const int ia[] = {0, 0, 1}; local 532 const int ia[] = {0, 0, 1}; local 548 const int ia[] = {0, 1, 2}; local 569 const int ia[] = {0, 1, 2}; local 590 const int ia[] = {0, 1, 2}; local 611 const int ia[] = {0, 1, 2}; local 632 const int ia[] = {0, 0, 1}; local 648 const int ia[] = {0, 0, 1}; local 674 const int ia[] = {0, 1, 2, 3, 0, 5, 6, 2, 4, 4}; local 714 const int ia[] = {0, 1, 2, 3, 0, 5, 6, 2, 4, 4}; local [all...] |
/external/libcxx/test/algorithms/alg.nonmodifying/alg.foreach/ |
H A D | test.pass.cpp | 31 int ia[] = {0, 1, 2, 3, 4, 5}; local 32 const unsigned s = sizeof(ia)/sizeof(ia[0]); 33 for_each_test f = std::for_each(input_iterator<int*>(ia), 34 input_iterator<int*>(ia+s), 38 assert(ia[i] == i+1);
|
/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.sorting/alg.heap.operations/make.heap/ |
H A D | make_heap_comp.pass.cpp | 34 int* ia = new int [N]; local 36 ia[i] = i; 37 std::random_shuffle(ia, ia+N); 38 std::make_heap(ia, ia+N, std::greater<int>()); 39 assert(std::is_heap(ia, ia+N, std::greater<int>())); 40 delete [] ia; 55 std::unique_ptr<int>* ia local [all...] |
/external/libcxx/test/algorithms/alg.sorting/alg.heap.operations/push.heap/ |
H A D | push_heap_comp.pass.cpp | 35 int* ia = new int [N]; local 37 ia[i] = i; 38 std::random_shuffle(ia, ia+N); 41 std::push_heap(ia, ia+i, std::greater<int>()); 42 assert(std::is_heap(ia, ia+i, std::greater<int>())); 44 delete [] ia; 54 std::unique_ptr<int>* ia local [all...] |