| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/numerics/numeric.ops/adjacent.difference/ |
| adjacent_difference_op.pass.cpp | 35 int ib[s] = {0}; local
36 OutIter r = std::adjacent_difference(InIter(ia), InIter(ia+s), OutIter(ib),
38 assert(base(r) == ib + s);
40 assert(ib[i] == ir[i]);
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/numerics/numeric.ops/partial.sum/ |
| partial_sum.pass.cpp | 32 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]);
|
| partial_sum_op.pass.cpp | 34 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]);
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/algorithms/alg.modifying.operations/alg.copy/ |
| copy_if.pass.cpp | 36 int ib[N] = {0}; local
38 OutIter r = std::copy_if(InIter(ia), InIter(ia+N), OutIter(ib), Pred());
39 assert(base(r) == ib+N/3+1);
41 assert(ib[i] % 3 == 0);
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/algorithms/alg.modifying.operations/alg.reverse/ |
| reverse.pass.cpp | 33 int ib[] = {0, 1}; local
34 const unsigned sb = sizeof(ib)/sizeof(ib[0]);
35 std::reverse(Iter(ib), Iter(ib+sb));
36 assert(ib[0] == 1);
37 assert(ib[1] == 0);
|
| reverse_copy.pass.cpp | 34 const int ib[] = {0, 1}; local
35 const unsigned sb = sizeof(ib)/sizeof(ib[0]);
37 r = std::reverse_copy(InIter(ib), InIter(ib+sb), OutIter(jb));
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/algorithms/alg.nonmodifying/alg.is_permutation/ |
| is_permutation_pred.pass.cpp | 39 const int ib[] = {0}; local
43 forward_iterator<const int*>(ib),
47 forward_iterator<const int*>(ib),
52 forward_iterator<const int*>(ib),
53 forward_iterator<const int*>(ib + sa),
57 forward_iterator<const int*>(ib),
58 forward_iterator<const int*>(ib + sa - 1),
64 const int ib[] = {1}; local
68 forward_iterator<const int*>(ib),
73 forward_iterator<const int*>(ib),
81 const int ib[] = {0, 0}; local
102 const int ib[] = {0, 1}; local
118 const int ib[] = {1, 0}; local
134 const int ib[] = {1, 1}; local
150 const int ib[] = {0, 0}; local
166 const int ib[] = {0, 1}; local
187 const int ib[] = {1, 0}; local
208 const int ib[] = {1, 1}; local
224 const int ib[] = {0, 0}; local
240 const int ib[] = {0, 1}; local
261 const int ib[] = {1, 0}; local
282 const int ib[] = {1, 1}; local
298 const int ib[] = {0, 0}; local
314 const int ib[] = {0, 1}; local
330 const int ib[] = {1, 0}; local
346 const int ib[] = {1, 1}; local
368 const int ib[] = {1, 0, 0}; local
384 const int ib[] = {1, 0, 1}; local
400 const int ib[] = {1, 0, 2}; local
416 const int ib[] = {1, 1, 0}; local
432 const int ib[] = {1, 1, 1}; local
448 const int ib[] = {1, 1, 2}; local
464 const int ib[] = {1, 2, 0}; local
480 const int ib[] = {1, 2, 1}; local
496 const int ib[] = {1, 2, 2}; local
512 const int ib[] = {1, 0, 0}; local
533 const int ib[] = {1, 0, 1}; local
549 const int ib[] = {1, 0, 2}; local
570 const int ib[] = {1, 2, 0}; local
591 const int ib[] = {2, 1, 0}; local
612 const int ib[] = {2, 0, 1}; local
633 const int ib[] = {1, 0, 1}; local
649 const int ib[] = {1, 0, 0}; local
675 const int ib[] = {4, 2, 3, 0, 1, 4, 0, 5, 6, 2}; local
715 const int ib[] = {4, 2, 3, 0, 1, 4, 0, 5, 6, 0}; local
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/algorithms/alg.nonmodifying/alg.search/ |
| search_n.pass.cpp | 41 int ib[] = {0, 0, 1, 1, 2, 2}; local
42 const unsigned sb = sizeof(ib)/sizeof(ib[0]);
43 assert(std::search_n(Iter(ib), Iter(ib+sb), 0, 0) == Iter(ib));
44 assert(std::search_n(Iter(ib), Iter(ib+sb), 1, 0) == Iter(ib+0));
45 assert(std::search_n(Iter(ib), Iter(ib+sb), 2, 0) == Iter(ib+0))
[all...] |
| search_n_pred.pass.cpp | 76 int ib[] = {0, 0, 1, 1, 2, 2}; local
77 const unsigned sb = sizeof(ib)/sizeof(ib[0]);
78 assert(std::search_n(Iter(ib), Iter(ib+sb), 0, 0, count_equal()) == Iter(ib));
81 assert(std::search_n(Iter(ib), Iter(ib+sb), 1, 0, count_equal()) == Iter(ib+0));
84 assert(std::search_n(Iter(ib), Iter(ib+sb), 2, 0, count_equal()) == Iter(ib+0))
[all...] |
| search_pred.pass.cpp | 75 int ib[] = {0, 1, 2, 0, 1, 2, 3, 0, 1, 2, 3, 4}; local
76 const unsigned sb = sizeof(ib)/sizeof(ib[0]);
78 assert(std::search(Iter1(ib), Iter1(ib+sb), Iter2(ic), Iter2(ic+1), count_equal()) == Iter1(ib+1));
82 assert(std::search(Iter1(ib), Iter1(ib+sb), Iter2(id), Iter2(id+2), count_equal()) == Iter1(ib+1));
86 assert(std::search(Iter1(ib), Iter1(ib+sb), Iter2(ie), Iter2(ie+3), count_equal()) == Iter1(ib+4))
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/algorithms/alg.sorting/alg.set.operations/includes/ |
| includes.pass.cpp | 29 int ib[] = {2, 4}; local
30 const unsigned sb = sizeof(ib)/sizeof(ib[0]);
36 assert(std::includes(Iter1(ia), Iter1(ia), Iter2(ib), Iter2(ib)));
37 assert(!std::includes(Iter1(ia), Iter1(ia), Iter2(ib), Iter2(ib+1)));
38 assert(std::includes(Iter1(ia), Iter1(ia+1), Iter2(ib), Iter2(ib)));
41 assert(std::includes(Iter1(ia), Iter1(ia+sa), Iter2(ib), Iter2(ib+sb)))
[all...] |
| includes_comp.pass.cpp | 30 int ib[] = {2, 4}; local
31 const unsigned sb = sizeof(ib)/sizeof(ib[0]);
37 assert(std::includes(Iter1(ia), Iter1(ia), Iter2(ib), Iter2(ib), std::less<int>()));
38 assert(!std::includes(Iter1(ia), Iter1(ia), Iter2(ib), Iter2(ib+1), std::less<int>()));
39 assert(std::includes(Iter1(ia), Iter1(ia+1), Iter2(ib), Iter2(ib), std::less<int>()));
42 assert(std::includes(Iter1(ia), Iter1(ia+sa), Iter2(ib), Iter2(ib+sb), std::less<int>()))
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/algorithms/alg.sorting/alg.set.operations/set.intersection/ |
| set_intersection.pass.cpp | 32 int ib[] = {2, 4, 4, 6}; local
33 const int sb = sizeof(ib)/sizeof(ib[0]);
38 Iter2(ib), Iter2(ib+sb), OutIter(ic));
41 ce = std::set_intersection(Iter1(ib), Iter1(ib+sb),
|
| set_intersection_comp.pass.cpp | 34 int ib[] = {2, 4, 4, 6}; local
35 const int sb = sizeof(ib)/sizeof(ib[0]);
40 Iter2(ib), Iter2(ib+sb), OutIter(ic), std::less<int>());
43 ce = std::set_intersection(Iter1(ib), Iter1(ib+sb),
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/algorithms/alg.sorting/alg.set.operations/set.symmetric.difference/ |
| set_symmetric_difference.pass.cpp | 33 int ib[] = {2, 4, 4, 6}; local
34 const int sb = sizeof(ib)/sizeof(ib[0]);
39 Iter2(ib), Iter2(ib+sb), OutIter(ic));
42 ce = std::set_symmetric_difference(Iter1(ib), Iter1(ib+sb),
|
| set_symmetric_difference_comp.pass.cpp | 35 int ib[] = {2, 4, 4, 6}; local
36 const int sb = sizeof(ib)/sizeof(ib[0]);
41 Iter2(ib), Iter2(ib+sb),
45 ce = std::set_symmetric_difference(Iter1(ib), Iter1(ib+sb),
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/algorithms/alg.sorting/alg.set.operations/set.union/ |
| set_union.pass.cpp | 32 int ib[] = {2, 4, 4, 6}; local
33 const int sb = sizeof(ib)/sizeof(ib[0]);
38 Iter2(ib), Iter2(ib+sb), OutIter(ic));
41 ce = std::set_union(Iter1(ib), Iter1(ib+sb),
|
| set_union_comp.pass.cpp | 34 int ib[] = {2, 4, 4, 6}; local
35 const int sb = sizeof(ib)/sizeof(ib[0]);
40 Iter2(ib), Iter2(ib+sb), OutIter(ic), std::less<int>());
43 ce = std::set_union(Iter1(ib), Iter1(ib+sb),
|
| /libcore/luni/src/test/java/libcore/java/nio/ |
| OldAndroidNIOTest.java | 60 IntBuffer ib = IntBuffer.wrap(intArray); local
61 intBufferTest(ib);
365 IntBuffer ib = bb.asIntBuffer(); local
367 checkBuffer(ib);
368 assertEquals(1, ib.capacity());
369 assertEquals(0xA4A3A2A1, ib.get());
372 ib = bb.asIntBuffer();
374 checkBuffer(ib);
375 assertEquals(1, ib.capacity());
376 assertEquals(0xA1A2A3A4, ib.get())
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/algorithms/alg.modifying.operations/alg.rotate/ |
| rotate.pass.cpp | 40 int ib[] = {0, 1}; local
41 const unsigned sb = sizeof(ib)/sizeof(ib[0]);
42 r = std::rotate(Iter(ib), Iter(ib), Iter(ib+sb));
43 assert(base(r) == ib+sb);
44 assert(ib[0] == 0);
45 assert(ib[1] == 1);
46 r = std::rotate(Iter(ib), Iter(ib+1), Iter(ib+sb))
236 std::unique_ptr<int> ib[2]; local
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/algorithms/alg.sorting/alg.set.operations/set.difference/ |
| set_difference.pass.cpp | 32 int ib[] = {2, 4, 4, 6}; local
33 const int sb = sizeof(ib)/sizeof(ib[0]);
38 Iter2(ib), Iter2(ib+sb), OutIter(ic));
43 ce = std::set_difference(Iter1(ib), Iter1(ib+sb),
|
| set_difference_comp.pass.cpp | 34 int ib[] = {2, 4, 4, 6}; local
35 const int sb = sizeof(ib)/sizeof(ib[0]);
40 Iter2(ib), Iter2(ib+sb), OutIter(ic), std::less<int>());
45 ce = std::set_difference(Iter1(ib), Iter1(ib+sb),
|
| /external/jmonkeyengine/engine/src/core/com/jme3/scene/debug/ |
| SkeletonWire.java | 82 VertexBuffer ib = new VertexBuffer(Type.Index); local
84 ib.setupData(Usage.Static, 2, Format.UnsignedShort, sib);
85 setBuffer(ib);
|
| /external/clang/test/Analysis/engine/ |
| replay-without-inlining.c | 15 const unsigned char *ib; member in struct:__anon18054
18 } IB;
19 unsigned long gl(IB *input);
20 inline void gbs(IB *input, unsigned char *buf, int count);
21 void getB(IB *st, Hdr2 *usedtobeundef);
22 inline unsigned char gb(IB *input) {
25 return input->ib[(input->cur)++];
27 static void getID(IB *st, char str[4]) {
33 static void getH(IB *st, Hdr *header) {
37 static void readILBM(IB *st, Info *pic)
[all...] |
| /frameworks/av/media/libstagefright/codecs/amrnb/dec/src/ |
| d8_31pf.cpp | 173 Word16 ib; local
202 ib =
210 ib,
214 ib = ia - (Word16)(tempWord32 >> 1);
216 ib =
218 ib,
226 pos_indx[index1] = ib + (ic & 1);
229 ib =
235 ib =
237 ib,
351 Word16 ib; local
[all...] |
