/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.modifying.operations/alg.replace/ |
H A D | replace.pass.cpp | 28 int ia[] = {0, 1, 2, 3, 4}; local 29 const unsigned sa = sizeof(ia)/sizeof(ia[0]); 30 std::replace(Iter(ia), Iter(ia+sa), 2, 5); 31 assert(ia[0] == 0); 32 assert(ia[1] == 1); 33 assert(ia[2] == 5); 34 assert(ia[3] == 3); 35 assert(ia[ [all...] |
H A D | replace_if.pass.cpp | 29 int ia[] = {0, 1, 2, 3, 4}; local 30 const unsigned sa = sizeof(ia)/sizeof(ia[0]); 31 std::replace_if(Iter(ia), Iter(ia+sa), std::bind2nd(std::equal_to<int>(), 2), 5); 32 assert(ia[0] == 0); 33 assert(ia[1] == 1); 34 assert(ia[2] == 5); 35 assert(ia[3] == 3); 36 assert(ia[ [all...] |
/external/libcxx/test/algorithms/alg.nonmodifying/alg.adjacent.find/ |
H A D | adjacent_find.pass.cpp | 24 int ia[] = {0, 1, 2, 2, 0, 1, 2, 3}; local 25 const unsigned sa = sizeof(ia)/sizeof(ia[0]); 26 assert(std::adjacent_find(forward_iterator<const int*>(ia), 27 forward_iterator<const int*>(ia + sa)) == 28 forward_iterator<const int*>(ia+2)); 29 assert(std::adjacent_find(forward_iterator<const int*>(ia), 30 forward_iterator<const int*>(ia)) == 31 forward_iterator<const int*>(ia)); 32 assert(std::adjacent_find(forward_iterator<const int*>(ia [all...] |
H A D | adjacent_find_pred.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::adjacent_find(forward_iterator<const int*>(ia), 28 forward_iterator<const int*>(ia + sa), 30 forward_iterator<const int*>(ia+2)); 31 assert(std::adjacent_find(forward_iterator<const int*>(ia), 32 forward_iterator<const int*>(ia), 34 forward_iterator<const int*>(ia)); 35 assert(std::adjacent_find(forward_iterator<const int*>(ia [all...] |
/external/libcxx/test/algorithms/alg.nonmodifying/alg.count/ |
H A D | count.pass.cpp | 24 int ia[] = {0, 1, 2, 2, 0, 1, 2, 3}; local 25 const unsigned sa = sizeof(ia)/sizeof(ia[0]); 26 assert(std::count(input_iterator<const int*>(ia), 27 input_iterator<const int*>(ia + sa), 2) == 3); 28 assert(std::count(input_iterator<const int*>(ia), 29 input_iterator<const int*>(ia + sa), 7) == 0); 30 assert(std::count(input_iterator<const int*>(ia), 31 input_iterator<const int*>(ia), 2) == 0);
|
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/algorithms/alg.nonmodifying/alg.find/ |
H A D | find.pass.cpp | 24 int ia[] = {0, 1, 2, 3, 4, 5}; local 25 const unsigned s = sizeof(ia)/sizeof(ia[0]); 26 input_iterator<const int*> r = std::find(input_iterator<const int*>(ia), 27 input_iterator<const int*>(ia+s), 3); 29 r = std::find(input_iterator<const int*>(ia), input_iterator<const int*>(ia+s), 10); 30 assert(r == input_iterator<const int*>(ia+s));
|
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/make.heap/ |
H A D | make_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 assert(std::is_heap(ia, ia+N)); 28 delete [] ia;
|
/external/libcxx/test/algorithms/alg.sorting/alg.heap.operations/pop.heap/ |
H A D | pop_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); 29 std::pop_heap(ia, ia+i); 30 assert(std::is_heap(ia, ia [all...] |
/external/libcxx/test/algorithms/alg.sorting/alg.heap.operations/push.heap/ |
H A D | push_heap.pass.cpp | 23 int* ia = new int [N]; local 25 ia[i] = i; 26 std::random_shuffle(ia, ia+N); 29 std::push_heap(ia, ia+i); 30 assert(std::is_heap(ia, ia+i)); 32 delete [] ia;
|
/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...] |
/external/libcxx/test/iterators/stream.iterators/iterator.range/ |
H A D | begin_array.pass.cpp | 19 int ia[] = {1, 2, 3}; local 20 int* i = std::begin(ia); 23 assert(ia[0] == 2);
|
H A D | begin_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 | 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_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 | 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.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_point.pass.cpp | 29 const int ia[] = {2, 4, 6, 8, 10}; local 30 assert(std::partition_point(forward_iterator<const int*>(std::begin(ia)), 31 forward_iterator<const int*>(std::end(ia)), 32 is_odd()) == forward_iterator<const int*>(ia)); 35 const int ia[] = {1, 2, 4, 6, 8}; local 36 assert(std::partition_point(forward_iterator<const int*>(std::begin(ia)), 37 forward_iterator<const int*>(std::end(ia)), 38 is_odd()) == forward_iterator<const int*>(ia + 1)); 41 const int ia[] = {1, 3, 2, 4, 6}; local 42 assert(std::partition_point(forward_iterator<const int*>(std::begin(ia)), 47 const int ia[] = {1, 3, 5, 2, 4, 6}; local 53 const int ia[] = {1, 3, 5, 7, 2, 4}; local 59 const int ia[] = {1, 3, 5, 7, 9, 2}; local 65 const int ia[] = {1, 3, 5, 7, 9, 11}; local 71 const int ia[] = {1, 3, 5, 2, 4, 6, 7}; local [all...] |
/external/libcxx/test/algorithms/alg.modifying.operations/alg.random.shuffle/ |
H A D | random_shuffle.pass.cpp | 22 int ia[] = {1, 2, 3, 4}; local 25 const unsigned sa = sizeof(ia)/sizeof(ia[0]); 26 std::random_shuffle(ia, ia+sa); 27 assert(std::equal(ia, ia+sa, ia1)); 28 std::random_shuffle(ia, ia+sa); 29 assert(std::equal(ia, i [all...] |
/external/libcxx/test/algorithms/alg.nonmodifying/alg.equal/ |
H A D | equal.pass.cpp | 28 int ia[] = {0, 1, 2, 3, 4, 5}; local 29 const unsigned s = sizeof(ia)/sizeof(ia[0]); 31 assert(std::equal(input_iterator<const int*>(ia), 32 input_iterator<const int*>(ia+s), 33 input_iterator<const int*>(ia))); 35 assert(std::equal(input_iterator<const int*>(ia), 36 input_iterator<const int*>(ia+s), 37 input_iterator<const int*>(ia), 38 input_iterator<const int*>(ia [all...] |
/external/libcxx/test/algorithms/alg.nonmodifying/alg.is_permutation/ |
H A D | is_permutation.pass.cpp | 29 const int ia[] = {0}; local 31 const unsigned sa = sizeof(ia)/sizeof(ia[0]); 32 assert(std::is_permutation(forward_iterator<const int*>(ia), 33 forward_iterator<const int*>(ia + 0), 36 assert(std::is_permutation(forward_iterator<const int*>(ia), 37 forward_iterator<const int*>(ia + 0), 41 assert(std::is_permutation(forward_iterator<const int*>(ia), 42 forward_iterator<const int*>(ia + sa), 45 assert(std::is_permutation(forward_iterator<const int*>(ia), 56 const int ia[] = {0}; local 71 const int ia[] = {0, 0}; local 89 const int ia[] = {0, 0}; local 103 const int ia[] = {0, 0}; local 117 const int ia[] = {0, 0}; local 131 const int ia[] = {0, 1}; local 145 const int ia[] = {0, 1}; local 163 const int ia[] = {0, 1}; local 177 const int ia[] = {0, 1}; local 191 const int ia[] = {1, 0}; local 205 const int ia[] = {1, 0}; local 219 const int ia[] = {1, 0}; local 233 const int ia[] = {1, 0}; local 247 const int ia[] = {1, 1}; local 261 const int ia[] = {1, 1}; local 275 const int ia[] = {1, 1}; local 289 const int ia[] = {1, 1}; local 304 const int ia[] = {0, 0, 0}; local 318 const int ia[] = {0, 0, 0}; local 332 const int ia[] = {0, 0, 0}; local 346 const int ia[] = {0, 0, 0}; local 360 const int ia[] = {0, 0, 0}; local 374 const int ia[] = {0, 0, 0}; local 388 const int ia[] = {0, 0, 0}; local 402 const int ia[] = {0, 0, 0}; local 416 const int ia[] = {0, 0, 0}; local 430 const int ia[] = {0, 0, 1}; local 448 const int ia[] = {0, 0, 1}; local 462 const int ia[] = {0, 1, 2}; local 480 const int ia[] = {0, 1, 2}; local 498 const int ia[] = {0, 1, 2}; local 516 const int ia[] = {0, 1, 2}; local 534 const int ia[] = {0, 0, 1}; local 548 const int ia[] = {0, 0, 1}; local 570 const int ia[] = {0, 1, 2, 3, 0, 5, 6, 2, 4, 4}; local 592 const int ia[] = {0, 1, 2, 3, 0, 5, 6, 2, 4, 4}; local [all...] |