Searched defs:ib (Results 1 - 25 of 161) sorted by relevance

1234567

/external/libcxx/test/std/algorithms/alg.nonmodifying/alg.equal/
H A Dequal.pass.cpp30 int ib[s] = {0, 1, 2, 5, 4, 5}; local
46 input_iterator<const int*>(ib)));
50 input_iterator<const int*>(ib),
51 input_iterator<const int*>(ib+s)));
54 random_access_iterator<const int*>(ib),
55 random_access_iterator<const int*>(ib+s)));
/external/libcxx/test/std/algorithms/alg.nonmodifying/alg.is_permutation/
H A Dis_permutation.pass.cpp30 const int ib[] = {0}; local
34 forward_iterator<const int*>(ib)) == true);
38 forward_iterator<const int*>(ib),
39 forward_iterator<const int*>(ib + 0)) == true);
43 forward_iterator<const int*>(ib)) == true);
47 forward_iterator<const int*>(ib),
48 forward_iterator<const int*>(ib + sa)) == true);
51 forward_iterator<const int*>(ib),
52 forward_iterator<const int*>(ib + sa - 1)) == false);
57 const int ib[] local
72 const int ib[] = {0, 0}; local
90 const int ib[] = {0, 1}; local
104 const int ib[] = {1, 0}; local
118 const int ib[] = {1, 1}; local
132 const int ib[] = {0, 0}; local
146 const int ib[] = {0, 1}; local
164 const int ib[] = {1, 0}; local
178 const int ib[] = {1, 1}; local
192 const int ib[] = {0, 0}; local
206 const int ib[] = {0, 1}; local
220 const int ib[] = {1, 0}; local
234 const int ib[] = {1, 1}; local
248 const int ib[] = {0, 0}; local
262 const int ib[] = {0, 1}; local
276 const int ib[] = {1, 0}; local
290 const int ib[] = {1, 1}; local
305 const int ib[] = {1, 0, 0}; local
319 const int ib[] = {1, 0, 1}; local
333 const int ib[] = {1, 0, 2}; local
347 const int ib[] = {1, 1, 0}; local
361 const int ib[] = {1, 1, 1}; local
375 const int ib[] = {1, 1, 2}; local
389 const int ib[] = {1, 2, 0}; local
403 const int ib[] = {1, 2, 1}; local
417 const int ib[] = {1, 2, 2}; local
431 const int ib[] = {1, 0, 0}; local
449 const int ib[] = {1, 0, 1}; local
463 const int ib[] = {1, 0, 2}; local
481 const int ib[] = {1, 2, 0}; local
499 const int ib[] = {2, 1, 0}; local
517 const int ib[] = {2, 0, 1}; local
535 const int ib[] = {1, 0, 1}; local
549 const int ib[] = {1, 0, 0}; local
571 const int ib[] = {4, 2, 3, 0, 1, 4, 0, 5, 6, 2}; local
593 const int ib[] = {4, 2, 3, 0, 1, 4, 0, 5, 6, 0}; local
[all...]
/external/libcxx/test/std/algorithms/alg.sorting/alg.lex.comparison/
H A Dlexicographical_compare.pass.cpp29 int ib[] = {1, 2, 3}; local
30 assert(!std::lexicographical_compare(Iter1(ia), Iter1(ia+sa), Iter2(ib), Iter2(ib+2)));
31 assert( std::lexicographical_compare(Iter1(ib), Iter1(ib+2), Iter2(ia), Iter2(ia+sa)));
32 assert(!std::lexicographical_compare(Iter1(ia), Iter1(ia+sa), Iter2(ib), Iter2(ib+3)));
33 assert( std::lexicographical_compare(Iter1(ib), Iter1(ib+3), Iter2(ia), Iter2(ia+sa)));
34 assert( std::lexicographical_compare(Iter1(ia), Iter1(ia+sa), Iter2(ib
[all...]
H A Dlexicographical_compare_comp.pass.cpp31 int ib[] = {1, 2, 3}; local
34 assert(!std::lexicographical_compare(Iter1(ia), Iter1(ia+sa), Iter2(ib), Iter2(ib+2), c));
35 assert( std::lexicographical_compare(Iter1(ib), Iter1(ib+2), Iter2(ia), Iter2(ia+sa), c));
36 assert(!std::lexicographical_compare(Iter1(ia), Iter1(ia+sa), Iter2(ib), Iter2(ib+3), c));
37 assert( std::lexicographical_compare(Iter1(ib), Iter1(ib+3), Iter2(ia), Iter2(ia+sa), c));
38 assert(!std::lexicographical_compare(Iter1(ia), Iter1(ia+sa), Iter2(ib
[all...]
/external/libcxx/test/std/algorithms/alg.modifying.operations/alg.copy/
H A Dcopy.pass.cpp29 int ib[N] = {0}; local
31 OutIter r = std::copy(InIter(ia), InIter(ia+N), OutIter(ib));
32 assert(base(r) == ib+N);
34 assert(ia[i] == ib[i]);
H A Dcopy_backward.pass.cpp30 int ib[N] = {0}; local
32 OutIter r = std::copy_backward(InIter(ia), InIter(ia+N), OutIter(ib+N));
33 assert(base(r) == ib);
35 assert(ia[i] == ib[i]);
H A Dcopy_n.pass.cpp32 int ib[N] = {0}; local
34 OutIter r = std::copy_n(InIter(ia), UDI(N/2), OutIter(ib));
35 assert(base(r) == ib+N/2);
37 assert(ia[i] == ib[i]);
/external/libcxx/test/std/algorithms/alg.modifying.operations/alg.move/
H A Dmove.pass.cpp33 int ib[N] = {0}; local
35 OutIter r = std::move(InIter(ia), InIter(ia+N), OutIter(ib));
36 assert(base(r) == ib+N);
38 assert(ia[i] == ib[i]);
51 std::unique_ptr<int> ib[N]; local
53 OutIter r = std::move(InIter(ia), InIter(ia+N), OutIter(ib));
54 assert(base(r) == ib+N);
56 assert(*ib[i] == i);
H A Dmove_backward.pass.cpp33 int ib[N] = {0}; local
35 OutIter r = std::move_backward(InIter(ia), InIter(ia+N), OutIter(ib+N));
36 assert(base(r) == ib);
38 assert(ia[i] == ib[i]);
51 std::unique_ptr<int> ib[N]; local
53 OutIter r = std::move_backward(InIter(ia), InIter(ia+N), OutIter(ib+N));
54 assert(base(r) == ib);
56 assert(*ib[i] == i);
/external/libcxx/test/std/algorithms/alg.modifying.operations/alg.remove/
H A Dremove_copy.pass.cpp28 int ib[sa]; local
29 OutIter r = std::remove_copy(InIter(ia), InIter(ia+sa), OutIter(ib), 2);
30 assert(base(r) == ib + sa-3);
31 assert(ib[0] == 0);
32 assert(ib[1] == 1);
33 assert(ib[2] == 3);
34 assert(ib[3] == 4);
35 assert(ib[4] == 3);
36 assert(ib[5] == 4);
H A Dremove_copy_if.pass.cpp30 int ib[sa]; local
31 OutIter r = std::remove_copy_if(InIter(ia), InIter(ia+sa), OutIter(ib),
33 assert(base(r) == ib + sa-3);
34 assert(ib[0] == 0);
35 assert(ib[1] == 1);
36 assert(ib[2] == 3);
37 assert(ib[3] == 4);
38 assert(ib[4] == 3);
39 assert(ib[5] == 4);
/external/libcxx/test/std/algorithms/alg.modifying.operations/alg.replace/
H A Dreplace_copy.pass.cpp31 int ib[sa] = {0}; local
32 OutIter r = std::replace_copy(InIter(ia), InIter(ia+sa), OutIter(ib), 2, 5);
33 assert(base(r) == ib + sa);
34 assert(ib[0] == 0);
35 assert(ib[1] == 1);
36 assert(ib[2] == 5);
37 assert(ib[3] == 3);
38 assert(ib[4] == 4);
H A Dreplace_copy_if.pass.cpp32 int ib[sa] = {0}; local
33 OutIter r = std::replace_copy_if(InIter(ia), InIter(ia+sa), OutIter(ib),
35 assert(base(r) == ib + sa);
36 assert(ib[0] == 0);
37 assert(ib[1] == 1);
38 assert(ib[2] == 5);
39 assert(ib[3] == 3);
40 assert(ib[4] == 4);
/external/libcxx/test/std/algorithms/alg.modifying.operations/alg.rotate/
H A Drotate_copy.pass.cpp27 int ib[sa] = {0}; local
29 OutIter r = std::rotate_copy(InIter(ia), InIter(ia), InIter(ia), OutIter(ib));
30 assert(base(r) == ib);
32 r = std::rotate_copy(InIter(ia), InIter(ia), InIter(ia+1), OutIter(ib));
33 assert(base(r) == ib+1);
34 assert(ib[0] == 0);
36 r = std::rotate_copy(InIter(ia), InIter(ia+1), InIter(ia+1), OutIter(ib));
37 assert(base(r) == ib+1);
38 assert(ib[0] == 0);
40 r = std::rotate_copy(InIter(ia), InIter(ia), InIter(ia+2), OutIter(ib));
[all...]
/external/libcxx/test/std/algorithms/alg.modifying.operations/alg.transform/
H A Dbinary_transform.pass.cpp30 int ib[sa] = {1, 2, 3, 4, 5}; local
31 OutIter r = std::transform(InIter1(ib), InIter1(ib+sa), InIter2(ia),
32 OutIter(ib), std::minus<int>());
33 assert(base(r) == ib + sa);
34 assert(ib[0] == 1);
35 assert(ib[1] == 1);
36 assert(ib[2] == 1);
37 assert(ib[3] == 1);
38 assert(ib[
[all...]
H A Dunary_transform.pass.cpp30 int ib[sa] = {0}; local
31 OutIter r = std::transform(InIter(ia), InIter(ia+sa), OutIter(ib),
33 assert(base(r) == ib + sa);
34 assert(ib[0] == 1);
35 assert(ib[1] == 2);
36 assert(ib[2] == 3);
37 assert(ib[3] == 4);
38 assert(ib[4] == 5);
/external/libcxx/test/std/algorithms/alg.nonmodifying/alg.find.first.of/
H A Dfind_first_of.pass.cpp26 int ib[] = {1, 3, 5, 7}; local
27 const unsigned sb = sizeof(ib)/sizeof(ib[0]);
30 forward_iterator<const int*>(ib),
31 forward_iterator<const int*>(ib + sb)) ==
H A Dfind_first_of_pred.pass.cpp28 int ib[] = {1, 3, 5, 7}; local
29 const unsigned sb = sizeof(ib)/sizeof(ib[0]);
32 forward_iterator<const int*>(ib),
33 forward_iterator<const int*>(ib + sb),
/external/libcxx/test/std/algorithms/alg.nonmodifying/mismatch/
H A Dmismatch.pass.cpp28 int ib[] = {0, 1, 2, 3, 0, 1, 2, 3}; local
29 const unsigned sb = sizeof(ib)/sizeof(ib[0]); ((void)sb); // unused in c++11
34 assert(std::mismatch(II(ia), II(ia + sa), II(ib))
35 == (std::pair<II, II>(II(ia+3), II(ib+3))));
37 assert(std::mismatch(RAI(ia), RAI(ia + sa), RAI(ib))
38 == (std::pair<RAI, RAI>(RAI(ia+3), RAI(ib+3))));
41 assert(std::mismatch(II(ia), II(ia + sa), II(ib), II(ib+sb))
42 == (std::pair<II, II>(II(ia+3), II(ib
[all...]
/external/libcxx/test/std/algorithms/alg.sorting/alg.merge/
H A Dmerge.pass.cpp33 int* ib = new int[N]; local
38 ib[i] = 2*i+1;
40 InIter2(ib), InIter2(ib+N), OutIter(ic));
46 delete [] ib;
52 int* ib = new int[N]; local
58 std::copy(ic+N, ic+2*N, ib);
60 std::sort(ib, ib+N);
62 InIter2(ib), InIter
[all...]
H A Dmerge_comp.pass.cpp37 int* ib = new int[N]; local
42 ib[i] = 2*i+1;
44 std::reverse(ib, ib+N);
47 InIter2(ib), InIter2(ib+N), OutIter(ic), pred);
54 delete [] ib;
60 int* ib = new int[N]; local
66 std::copy(ic+N, ic+2*N, ib);
68 std::sort(ib, i
[all...]
/external/libcxx/test/std/localization/locale.categories/category.collate/locale.collate/locale.collate.members/
H A Dcompare.pass.cpp26 const char ib[] = "123"; local
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, ia+sa) == -1);
32 assert(f.compare(ia, ia+sa, ib
39 const wchar_t ib[] = L"123"; local
[all...]
/external/libcxx/test/std/numerics/numeric.ops/partial.sum/
H A Dpartial_sum.pass.cpp32 int ib[s] = {0}; local
33 OutIter r = std::partial_sum(InIter(ia), InIter(ia+s), OutIter(ib));
34 assert(base(r) == ib + s);
36 assert(ib[i] == ir[i]);
H A Dpartial_sum_op.pass.cpp34 int ib[s] = {0}; local
35 OutIter r = std::partial_sum(InIter(ia), InIter(ia+s), OutIter(ib), std::minus<int>());
36 assert(base(r) == ib + s);
38 assert(ib[i] == ir[i]);
/external/mesa3d/src/gallium/drivers/r600/
H A Dr600_translate.c32 struct pipe_index_buffer *ib,
39 switch (ib->index_size) {
45 &r600->context, ib, 0, ib->offset, count, ptr);
47 pipe_resource_reference(&ib->buffer, NULL);
48 ib->buffer = out_buffer;
49 ib->offset = out_offset;
50 ib->index_size = 2;
31 r600_translate_index_buffer(struct r600_context *r600, struct pipe_index_buffer *ib, unsigned count) argument

Completed in 604 milliseconds

1234567