/ndk/sources/cxx-stl/llvm-libc++/test/algorithms/alg.nonmodifying/alg.adjacent.find/ |
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+3) [all...] |
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+3) [all...] |
/ndk/sources/cxx-stl/llvm-libc++/test/algorithms/alg.nonmodifying/alg.count/ |
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);
|
/ndk/sources/cxx-stl/llvm-libc++/test/algorithms/alg.nonmodifying/alg.is_permutation/ |
is_permutation.pass.cpp | 25 const int ia[] = {0}; local 27 const unsigned sa = sizeof(ia)/sizeof(ia[0]); 28 assert(std::is_permutation(forward_iterator<const int*>(ia), 29 forward_iterator<const int*>(ia + 0), 31 assert(std::is_permutation(forward_iterator<const int*>(ia), 32 forward_iterator<const int*>(ia + sa), 36 const int ia[] = {0}; local 38 const unsigned sa = sizeof(ia)/sizeof(ia[0]) 45 const int ia[] = {0, 0}; local 53 const int ia[] = {0, 0}; local 61 const int ia[] = {0, 0}; local 69 const int ia[] = {0, 0}; local 77 const int ia[] = {0, 1}; local 85 const int ia[] = {0, 1}; local 93 const int ia[] = {0, 1}; local 101 const int ia[] = {0, 1}; local 109 const int ia[] = {1, 0}; local 117 const int ia[] = {1, 0}; local 125 const int ia[] = {1, 0}; local 133 const int ia[] = {1, 0}; local 141 const int ia[] = {1, 1}; local 149 const int ia[] = {1, 1}; local 157 const int ia[] = {1, 1}; local 165 const int ia[] = {1, 1}; local 174 const int ia[] = {0, 0, 0}; local 182 const int ia[] = {0, 0, 0}; local 190 const int ia[] = {0, 0, 0}; local 198 const int ia[] = {0, 0, 0}; local 206 const int ia[] = {0, 0, 0}; local 214 const int ia[] = {0, 0, 0}; local 222 const int ia[] = {0, 0, 0}; local 230 const int ia[] = {0, 0, 0}; local 238 const int ia[] = {0, 0, 0}; local 246 const int ia[] = {0, 0, 1}; local 254 const int ia[] = {0, 0, 1}; local 262 const int ia[] = {0, 1, 2}; local 270 const int ia[] = {0, 1, 2}; local 278 const int ia[] = {0, 1, 2}; local 286 const int ia[] = {0, 1, 2}; local 294 const int ia[] = {0, 0, 1}; local 302 const int ia[] = {0, 0, 1}; local 310 const int ia[] = {0, 1, 2, 3, 0, 5, 6, 2, 4, 4}; local 318 const int ia[] = {0, 1, 2, 3, 0, 5, 6, 2, 4, 4}; local [all...] |
is_permutation_pred.pass.cpp | 26 const int ia[] = {0}; local 28 const unsigned sa = sizeof(ia)/sizeof(ia[0]); 29 assert(std::is_permutation(forward_iterator<const int*>(ia), 30 forward_iterator<const int*>(ia + 0), 33 assert(std::is_permutation(forward_iterator<const int*>(ia), 34 forward_iterator<const int*>(ia + sa), 39 const int ia[] = {0}; local 41 const unsigned sa = sizeof(ia)/sizeof(ia[0]) 49 const int ia[] = {0, 0}; local 58 const int ia[] = {0, 0}; local 67 const int ia[] = {0, 0}; local 76 const int ia[] = {0, 0}; local 85 const int ia[] = {0, 1}; local 94 const int ia[] = {0, 1}; local 103 const int ia[] = {0, 1}; local 112 const int ia[] = {0, 1}; local 121 const int ia[] = {1, 0}; local 130 const int ia[] = {1, 0}; local 139 const int ia[] = {1, 0}; local 148 const int ia[] = {1, 0}; local 157 const int ia[] = {1, 1}; local 166 const int ia[] = {1, 1}; local 175 const int ia[] = {1, 1}; local 184 const int ia[] = {1, 1}; local 194 const int ia[] = {0, 0, 0}; local 203 const int ia[] = {0, 0, 0}; local 212 const int ia[] = {0, 0, 0}; local 221 const int ia[] = {0, 0, 0}; local 230 const int ia[] = {0, 0, 0}; local 239 const int ia[] = {0, 0, 0}; local 248 const int ia[] = {0, 0, 0}; local 257 const int ia[] = {0, 0, 0}; local 266 const int ia[] = {0, 0, 0}; local 275 const int ia[] = {0, 0, 1}; local 284 const int ia[] = {0, 0, 1}; local 293 const int ia[] = {0, 1, 2}; local 302 const int ia[] = {0, 1, 2}; local 311 const int ia[] = {0, 1, 2}; local 320 const int ia[] = {0, 1, 2}; local 329 const int ia[] = {0, 0, 1}; local 338 const int ia[] = {0, 0, 1}; local 347 const int ia[] = {0, 1, 2, 3, 0, 5, 6, 2, 4, 4}; local 356 const int ia[] = {0, 1, 2, 3, 0, 5, 6, 2, 4, 4}; local [all...] |
/ndk/sources/cxx-stl/llvm-libc++/test/algorithms/alg.modifying.operations/alg.random.shuffle/ |
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, ia+sa, ia2)) [all...] |
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, ia+sa, ia2)) [all...] |
random_shuffle_rand.pass.cpp | 31 int ia[] = {1, 2, 3, 4}; local 33 const unsigned sa = sizeof(ia)/sizeof(ia[0]); 35 std::random_shuffle(ia, ia+sa, r); 36 assert(std::equal(ia, ia+sa, ia1));
|
/ndk/sources/cxx-stl/llvm-libc++/test/algorithms/alg.nonmodifying/alg.any_of/ |
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[0]) 48 const int ia[] = {1, 3, 5, 7}; local [all...] |
/ndk/sources/cxx-stl/llvm-libc++/test/algorithms/alg.nonmodifying/alg.none_of/ |
none_of.pass.cpp | 32 int ia[] = {2, 4, 6, 8}; local 33 const unsigned sa = sizeof(ia)/sizeof(ia[0]); 34 assert(std::none_of(input_iterator<const int*>(ia), 35 input_iterator<const int*>(ia + sa), test1()) == false); 36 assert(std::none_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[0]) 48 const int ia[] = {1, 3, 5, 7}; local [all...] |
/ndk/sources/cxx-stl/llvm-libc++/test/algorithms/alg.modifying.operations/alg.partitions/ |
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...] |
/ndk/sources/cxx-stl/llvm-libc++/test/algorithms/alg.nonmodifying/alg.equal/ |
equal.pass.cpp | 24 int ia[] = {0, 1, 2, 3, 4, 5}; local 25 const unsigned s = sizeof(ia)/sizeof(ia[0]); 27 assert(std::equal(input_iterator<const int*>(ia), 28 input_iterator<const int*>(ia+s), 29 input_iterator<const int*>(ia))); 30 assert(!std::equal(input_iterator<const int*>(ia), 31 input_iterator<const int*>(ia+s),
|
/ndk/sources/cxx-stl/llvm-libc++/test/algorithms/alg.nonmodifying/alg.find/ |
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));
|
/ndk/sources/cxx-stl/llvm-libc++/test/algorithms/alg.nonmodifying/alg.all_of/ |
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[0]) [all...] |
/ndk/sources/cxx-stl/llvm-libc++/test/iterators/stream.iterators/iterator.range/ |
begin_const.pass.cpp | 19 int ia[] = {1, 2, 3}; local 20 const std::vector<int> v(ia, ia + sizeof(ia)/sizeof(ia[0]));
|
begin_array.pass.cpp | 19 int ia[] = {1, 2, 3}; local 20 int* i = std::begin(ia); 23 assert(ia[0] == 2);
|
/ndk/sources/cxx-stl/llvm-libc++/test/algorithms/alg.modifying.operations/alg.remove/ |
remove_if.pass.cpp | 31 int ia[] = {0, 1, 2, 3, 4, 2, 3, 4, 2}; local 32 const unsigned sa = sizeof(ia)/sizeof(ia[0]); 33 int* r = std::remove_if(ia, ia+sa, std::bind2nd(std::equal_to<int>(), 2)); 34 assert(r == ia + sa-3); 35 assert(ia[0] == 0); 36 assert(ia[1] == 1); 37 assert(ia[2] == 3); 38 assert(ia[3] == 4) 55 std::unique_ptr<int> ia[sa]; local [all...] |
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[3] == 4) 49 std::unique_ptr<int> ia[sa]; local [all...] |
/ndk/sources/cxx-stl/llvm-libc++/test/algorithms/alg.modifying.operations/alg.replace/ |
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[4] == 4) [all...] |
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[4] == 4) [all...] |
/ndk/sources/cxx-stl/llvm-libc++/test/numerics/numeric.ops/accumulate/ |
accumulate.pass.cpp | 34 int ia[] = {1, 2, 3, 4, 5, 6}; local 35 unsigned sa = sizeof(ia) / sizeof(ia[0]); 36 test(Iter(ia), Iter(ia), 0, 0); 37 test(Iter(ia), Iter(ia), 10, 10); 38 test(Iter(ia), Iter(ia+1), 0, 1); 39 test(Iter(ia), Iter(ia+1), 10, 11) [all...] |
/ndk/sources/cxx-stl/llvm-libc++/test/algorithms/alg.sorting/alg.heap.operations/pop.heap/ |
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+i-1)) [all...] |
/ndk/sources/cxx-stl/llvm-libc++/test/algorithms/alg.modifying.operations/alg.generate/ |
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);
|
/ndk/sources/cxx-stl/llvm-libc++/test/algorithms/alg.sorting/alg.heap.operations/make.heap/ |
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;
|
/ndk/sources/cxx-stl/llvm-libc++/test/algorithms/alg.sorting/alg.heap.operations/push.heap/ |
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;
|