Searched refs:ia (Results 1 - 25 of 204) sorted by relevance

123456789

/external/libcxx/test/algorithms/alg.nonmodifying/alg.adjacent.find/
H A Dadjacent_find.pass.cpp24 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 Dadjacent_find_pred.pass.cpp25 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 Dcount.pass.cpp24 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);
/external/libcxx/test/algorithms/alg.modifying.operations/alg.random.shuffle/
H A Drandom_shuffle.pass.cpp22 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...]
H A Drandom_shuffle_urng.pass.cpp22 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...]
H A Drandom_shuffle_rand.pass.cpp31 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));
/external/libcxx/test/algorithms/alg.nonmodifying/alg.any_of/
H A Dany_of.pass.cpp32 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.none_of/
H A Dnone_of.pass.cpp32 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[
48 const int ia[] = {1, 3, 5, 7}; local
[all...]
/external/libcxx/test/algorithms/alg.modifying.operations/alg.partitions/
H A Dpartition_point.pass.cpp29 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.nonmodifying/alg.find/
H A Dfind.pass.cpp24 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));
/external/libcxx/test/algorithms/alg.nonmodifying/alg.all_of/
H A Dall_of.pass.cpp32 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/iterators/stream.iterators/iterator.range/
H A Dbegin_const.pass.cpp19 int ia[] = {1, 2, 3}; local
20 const std::vector<int> v(ia, ia + sizeof(ia)/sizeof(ia[0]));
H A Dbegin_array.pass.cpp19 int ia[] = {1, 2, 3}; local
20 int* i = std::begin(ia);
23 assert(ia[0] == 2);
/external/libcxx/test/algorithms/alg.modifying.operations/alg.remove/
H A Dremove_if.pass.cpp31 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[
55 std::unique_ptr<int> ia[sa]; local
[all...]
H A Dremove.pass.cpp30 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...]
/external/libcxx/test/algorithms/alg.modifying.operations/alg.replace/
H A Dreplace.pass.cpp28 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 Dreplace_if.pass.cpp29 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/numerics/numeric.ops/accumulate/
H A Daccumulate.pass.cpp34 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), Ite
[all...]
/external/libcxx/test/algorithms/alg.sorting/alg.heap.operations/pop.heap/
H A Dpop_heap.pass.cpp22 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.nonmodifying/alg.is_permutation/
H A Dis_permutation.pass.cpp29 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...]
/external/libcxx/test/algorithms/alg.modifying.operations/alg.generate/
H A Dgenerate.pass.cpp33 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);
/external/libcxx/test/algorithms/alg.nonmodifying/alg.equal/
H A Dequal.pass.cpp28 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.sorting/alg.heap.operations/make.heap/
H A Dmake_heap.pass.cpp22 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/push.heap/
H A Dpush_heap.pass.cpp23 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/localization/locale.categories/category.collate/locale.collate/locale.collate.members/
H A Dcompare.pass.cpp24 const char ia[] = "1234"; local
25 const unsigned sa = sizeof(ia)/sizeof(ia[0]);
28 assert(f.compare(ia, ia+sa, ib, ib+2) == 1);
29 assert(f.compare(ib, ib+2, ia, ia+sa) == -1);
30 assert(f.compare(ia, ia+sa, ib, ib+3) == 1);
31 assert(f.compare(ib, ib+3, ia, i
37 const wchar_t ia[] = L"1234"; local
[all...]

Completed in 288 milliseconds

123456789