| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/algorithms/alg.modifying.operations/alg.unique/ |
| unique.pass.cpp | 30 int ia[] = {0}; local
31 const unsigned sa = sizeof(ia)/sizeof(ia[0]);
32 Iter r = std::unique(Iter(ia), Iter(ia+sa));
33 assert(base(r) == ia + sa);
34 assert(ia[0] == 0);
102 Ptr ia[1]; local
103 const unsigned sa = sizeof(ia)/sizeof(ia[0])
[all...] |
| unique_pred.pass.cpp | 40 int ia[] = {0}; local
41 const unsigned sa = sizeof(ia)/sizeof(ia[0]);
43 Iter r = std::unique(Iter(ia), Iter(ia+sa), count_equal());
44 assert(base(r) == ia + sa);
45 assert(ia[0] == 0);
128 Ptr ia[1]; local
129 const unsigned sa = sizeof(ia)/sizeof(ia[0])
[all...] |
| /external/apache-harmony/jdwp/src/test/java/org/apache/harmony/jpda/tests/jdwp/ArrayType/ |
| NewInstanceDebuggee.java | 40 int[][] ia = { { 123 }, { 23, 34 }, { 2, 4, 6, 8 } }; local
46 logWriter.println("DUMP{" + checkString + checkInt + ia + ca + "}");
|
| /libcore/luni/src/main/java/java/net/ |
| Inet6Address.java | 129 InetAddress ia = addressList.nextElement(); local
130 if (ia.getAddress().length == 16) {
131 Inet6Address v6ia = (Inet6Address) ia;
156 * <li>{@code ia} is neither site local nor link local</li>
159 private boolean compareLocalType(Inet6Address ia) {
160 if (ia.isSiteLocalAddress() && isSiteLocalAddress()) {
163 if (ia.isLinkLocalAddress() && isLinkLocalAddress()) {
166 if (!ia.isSiteLocalAddress() && !ia.isLinkLocalAddress()) {
|
| /frameworks/av/media/libstagefright/codecs/amrnb/enc/src/ |
| c8_31pf.cpp | 443 Word16 ia; local
451 ia = pos_indxA >> 1;
471 ib += ia;
475 ia = pos_indxA & 1;
483 ib += ia;
572 Word16 ia; local
587 indx[NB_TRACK] = (ia/2+(ib/2)*5 +(ic/2)*25)*8 + ia%2 + (ib%2)*2 + (ic%2)*4; */
597 indx[NB_TRACK+1] = (ia/2+(ib/2)*5 +(ic/2)*25)*8 + ia%2 + (ib%2)*2 + (ic%2)*4; *
[all...] |
| /libcore/harmony-tests/src/test/java/org/apache/harmony/tests/java/net/ |
| InetAddressTest.java | 67 InetAddress ia = InetAddress.getByName("127.0.0.1"); local
69 byte[] addr = ia.getAddress();
102 for (InetAddress ia : ias) {
103 assertTrue(ia.isLoopbackAddress());
107 for (InetAddress ia : ias) {
108 assertTrue(ia.isLoopbackAddress());
315 InetAddress ia = Inet4Address.getByName("127.0.0.1"); local
316 assertTrue(ia.isReachable(10000));
317 ia = Inet4Address.getByName("127.0.0.1");
319 ia.isReachable(-1)
331 InetAddress ia = Inet4Address.getByName("127.0.0.1"); local
[all...] |
| /external/chromium_org/google_apis/gaia/ |
| oauth2_mint_token_flow_unittest.cc | 112 IssueAdviceInfo ia; local
116 ia.push_back(e1);
121 ia.push_back(e2);
122 return ia;
255 IssueAdviceInfo ia; local
257 json.get(), &ia));
258 EXPECT_TRUE(ia.empty());
263 IssueAdviceInfo ia; local
265 json.get(), &ia));
266 EXPECT_TRUE(ia.empty())
271 IssueAdviceInfo ia; local
[all...] |
| /external/libcxx/test/numerics/numeric.ops/adjacent.difference/ |
| adjacent_difference.pass.cpp | 31 int ia[] = {15, 10, 6, 3, 1}; local
33 const unsigned s = sizeof(ia) / sizeof(ia[0]);
35 OutIter r = std::adjacent_difference(InIter(ia), InIter(ia+s), OutIter(ib));
|
| adjacent_difference_op.pass.cpp | 32 int ia[] = {15, 10, 6, 3, 1}; local
34 const unsigned s = sizeof(ia) / sizeof(ia[0]);
36 OutIter r = std::adjacent_difference(InIter(ia), InIter(ia+s), OutIter(ib),
|
| /libcore/luni/src/test/java/libcore/java/net/ |
| InetSocketAddressTest.java | 59 InetAddress ia = InetAddress.getByName(validIPAddresses[i]); local
60 InetSocketAddress isa = new InetSocketAddress(ia, 80);
121 InetAddress ia = InetAddress.getByName(validIPAddresses[i]); local
122 InetSocketAddress isa = new InetSocketAddress(ia, 0);
123 assertEquals(ia, isa.getAddress());
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/numerics/numeric.ops/adjacent.difference/ |
| adjacent_difference.pass.cpp | 31 int ia[] = {15, 10, 6, 3, 1}; local
33 const unsigned s = sizeof(ia) / sizeof(ia[0]);
35 OutIter r = std::adjacent_difference(InIter(ia), InIter(ia+s), OutIter(ib));
|
| adjacent_difference_op.pass.cpp | 32 int ia[] = {15, 10, 6, 3, 1}; local
34 const unsigned s = sizeof(ia) / sizeof(ia[0]);
36 OutIter r = std::adjacent_difference(InIter(ia), InIter(ia+s), OutIter(ib),
|
| /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/ctypes/test/ |
| test_arrays.py | 20 ia = int_array(*init)
22 self.assertEqual(len(ia), alen)
25 values = [ia[i] for i in range(len(init))]
31 [setitem(ia, n, new_values[n]) for n in range(alen)]
32 values = [ia[i] for i in range(len(init))]
36 ia = int_array()
37 values = [ia[i] for i in range(len(init))]
|
| /prebuilts/python/linux-x86/2.7.5/lib/python2.7/ctypes/test/ |
| test_arrays.py | 20 ia = int_array(*init)
22 self.assertEqual(len(ia), alen)
25 values = [ia[i] for i in range(len(init))]
31 [setitem(ia, n, new_values[n]) for n in range(alen)]
32 values = [ia[i] for i in range(len(init))]
36 ia = int_array()
37 values = [ia[i] for i in range(len(init))]
|
| /external/libcxx/test/algorithms/alg.modifying.operations/alg.unique/ |
| unique_pred.pass.cpp | 40 int ia[] = {0}; local
41 const unsigned sa = sizeof(ia)/sizeof(ia[0]);
43 Iter r = std::unique(Iter(ia), Iter(ia+sa), count_equal());
44 assert(base(r) == ia + sa);
45 assert(ia[0] == 0);
128 Ptr ia[1]; local
129 const unsigned sa = sizeof(ia)/sizeof(ia[0])
[all...] |
| /external/libcxx/test/algorithms/alg.sorting/alg.merge/ |
| merge_comp.pass.cpp | 33 int* ia = new int[N]; local
37 ia[i] = 2*i;
40 std::reverse(ia, ia+N);
42 OutIter r = std::merge(InIter1(ia), InIter1(ia+N),
50 delete [] ia;
54 int* ia = new int[N]; local
60 std::copy(ic, ic+N, ia);
62 std::sort(ia, ia+N, std::greater<int>())
[all...] |
| merge.pass.cpp | 30 int* ia = new int[N]; local
34 ia[i] = 2*i;
37 OutIter r = std::merge(InIter1(ia), InIter1(ia+N),
45 delete [] ia;
49 int* ia = new int[N]; local
55 std::copy(ic, ic+N, ia);
57 std::sort(ia, ia+N);
59 OutIter r = std::merge(InIter1(ia), InIter1(ia+N)
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/algorithms/alg.sorting/alg.merge/ |
| merge_comp.pass.cpp | 33 int* ia = new int[N]; local
37 ia[i] = 2*i;
40 std::reverse(ia, ia+N);
42 OutIter r = std::merge(InIter1(ia), InIter1(ia+N),
50 delete [] ia;
54 int* ia = new int[N]; local
60 std::copy(ic, ic+N, ia);
62 std::sort(ia, ia+N, std::greater<int>())
[all...] |
| /external/icu/icu4c/source/layout/ |
| IndicRearrangementProcessor.cpp | 73 le_int32 ia, ib, ic, id, ix, x; local
83 ia = glyphStorage.getCharIndex(firstGlyph, success);
94 glyphStorage.setCharIndex(lastGlyph, ia, success);
115 ia = glyphStorage.getCharIndex(firstGlyph, success);
122 glyphStorage.setCharIndex(lastGlyph, ia, success);
128 ia = glyphStorage.getCharIndex(firstGlyph, success);
142 glyphStorage.setCharIndex(lastGlyph - 1, ia, success);
149 ia = glyphStorage.getCharIndex(firstGlyph, success);
164 glyphStorage.setCharIndex(lastGlyph, ia, success);
213 ia = glyphStorage.getCharIndex(firstGlyph, success)
[all...] |
| IndicRearrangementProcessor2.cpp | 70 le_int32 ia, ib, ic, id, ix, x; local
80 ia = glyphStorage.getCharIndex(firstGlyph, success);
91 glyphStorage.setCharIndex(lastGlyph, ia, success);
112 ia = glyphStorage.getCharIndex(firstGlyph, success);
119 glyphStorage.setCharIndex(lastGlyph, ia, success);
125 ia = glyphStorage.getCharIndex(firstGlyph, success);
139 glyphStorage.setCharIndex(lastGlyph - 1, ia, success);
146 ia = glyphStorage.getCharIndex(firstGlyph, success);
161 glyphStorage.setCharIndex(lastGlyph, ia, success);
210 ia = glyphStorage.getCharIndex(firstGlyph, success)
[all...] |
| /external/libcxx/test/algorithms/alg.modifying.operations/alg.rotate/ |
| rotate.pass.cpp | 28 int ia[] = {0}; local
29 const unsigned sa = sizeof(ia)/sizeof(ia[0]);
30 Iter r = std::rotate(Iter(ia), Iter(ia), Iter(ia));
31 assert(base(r) == ia);
32 assert(ia[0] == 0);
33 r = std::rotate(Iter(ia), Iter(ia), Iter(ia+sa))
222 std::unique_ptr<int> ia[1]; local
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/algorithms/alg.modifying.operations/alg.rotate/ |
| rotate.pass.cpp | 28 int ia[] = {0}; local
29 const unsigned sa = sizeof(ia)/sizeof(ia[0]);
30 Iter r = std::rotate(Iter(ia), Iter(ia), Iter(ia));
31 assert(base(r) == ia);
32 assert(ia[0] == 0);
33 r = std::rotate(Iter(ia), Iter(ia), Iter(ia+sa))
222 std::unique_ptr<int> ia[1]; local
[all...] |
| /external/chromium_org/third_party/skia/tests/ |
| TestSize.cpp | 60 SkISize ia; local
61 ia.set(ix, iy);
63 REPORTER_ASSERT(reporter, a.toRound() == ia);
|
| /external/libcxx/test/numerics/numarray/template.indirect.array/indirect.array.assign/ |
| indirect_array.pass.cpp | 14 // const indirect_array& operator=(const indirect_array& ia) const;
36 std::valarray<std::size_t> ia(s, S);
37 v1[ia] = v2[ia];
|
| /external/skia/tests/ |
| TestSize.cpp | 60 SkISize ia; local
61 ia.set(ix, iy);
63 REPORTER_ASSERT(reporter, a.toRound() == ia);
|
