| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/numerics/numarray/template.indirect.array/indirect.array.comp.assign/ |
| modulo.pass.cpp | 33 std::valarray<std::size_t> ia(s, N2);
34 v1[ia] %= v2;
|
| multiply.pass.cpp | 33 std::valarray<std::size_t> ia(s, N2);
34 v1[ia] *= v2;
|
| or.pass.cpp | 33 std::valarray<std::size_t> ia(s, N2);
34 v1[ia] |= v2;
|
| shift_left.pass.cpp | 33 std::valarray<std::size_t> ia(s, N2);
34 v1[ia] <<= v2;
|
| shift_right.pass.cpp | 33 std::valarray<std::size_t> ia(s, N2);
34 v1[ia] >>= v2;
|
| subtraction.pass.cpp | 33 std::valarray<std::size_t> ia(s, N2);
34 v1[ia] -= v2;
|
| xor.pass.cpp | 33 std::valarray<std::size_t> ia(s, N2);
34 v1[ia] ^= v2;
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/numerics/numarray/template.indirect.array/indirect.array.fill/ |
| assign_value.pass.cpp | 30 std::valarray<std::size_t> ia(s, S);
31 v1[ia] = 51;
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/numerics/numarray/template.valarray/valarray.assign/ |
| indirect_array_assign.pass.cpp | 14 // valarray& operator=(const indirect_array<value_type>& ia);
30 std::valarray<std::size_t> ia(s, S);
32 v = v1[ia];
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/numerics/numarray/template.valarray/valarray.cons/ |
| indirect_array.pass.cpp | 14 // valarray(const indirect_array<value_type>& ia);
30 std::valarray<std::size_t> ia(s, S);
31 std::valarray<int> v(v1[ia]);
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/numerics/numarray/template.valarray/valarray.sub/ |
| indirect_array_const.pass.cpp | 30 std::valarray<std::size_t> ia(s, S);
31 std::valarray<int> v = v1[ia];
|
| indirect_array_non_const.pass.cpp | 30 std::valarray<std::size_t> ia(s, S);
32 v = v1[ia];
|
| /external/libcxx/test/algorithms/alg.modifying.operations/alg.unique/ |
| unique_copy.pass.cpp | 29 const int ia[] = {0}; local
30 const unsigned sa = sizeof(ia)/sizeof(ia[0]);
32 OutIter r = std::unique_copy(InIter(ia), InIter(ia+sa), OutIter(ja));
|
| /libcore/luni/src/test/java/libcore/java/net/ |
| NetworkInterfaceTest.java | 77 for (InterfaceAddress ia : lo.getInterfaceAddresses()) {
78 assertNull(ia.getBroadcast());
85 for (InterfaceAddress ia : eth0.getInterfaceAddresses()) {
86 if (ia.getAddress() instanceof Inet4Address) {
87 assertNotNull(ia.getBroadcast());
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/algorithms/alg.modifying.operations/alg.unique/ |
| unique_copy.pass.cpp | 29 const int ia[] = {0}; local
30 const unsigned sa = sizeof(ia)/sizeof(ia[0]);
32 OutIter r = std::unique_copy(InIter(ia), InIter(ia+sa), OutIter(ja));
|
| /external/libedit/src/ |
| unvis.c | 197 unsigned char st, ia, is, lc; local
436 ia = *cp; /* index in the array */
438 lc = is == 0 ? 0 : nv[ia].name[is - 1]; /* last character */
443 for (; ia < __arraycount(nv); ia++) {
444 if (is != 0 && nv[ia].name[is - 1] != lc)
446 if (nv[ia].name[is] == uc)
450 if (ia == __arraycount(nv))
454 *cp = ia;
459 *cp = nv[ia].value
[all...] |
| /external/libcxx/test/algorithms/alg.sorting/alg.set.operations/set.difference/ |
| set_difference.pass.cpp | 30 int ia[] = {1, 2, 2, 3, 3, 3, 4, 4, 4, 4}; local
31 const int sa = sizeof(ia)/sizeof(ia[0]);
37 OutIter ce = std::set_difference(Iter1(ia), Iter1(ia+sa),
44 Iter2(ia), Iter2(ia+sa), OutIter(ic));
|
| /external/libcxx/test/algorithms/alg.sorting/alg.set.operations/set.intersection/ |
| set_intersection.pass.cpp | 30 int ia[] = {1, 2, 2, 3, 3, 3, 4, 4, 4, 4}; local
31 const int sa = sizeof(ia)/sizeof(ia[0]);
37 OutIter ce = std::set_intersection(Iter1(ia), Iter1(ia+sa),
42 Iter2(ia), Iter2(ia+sa), OutIter(ic));
|
| set_intersection_comp.pass.cpp | 32 int ia[] = {1, 2, 2, 3, 3, 3, 4, 4, 4, 4}; local
33 const int sa = sizeof(ia)/sizeof(ia[0]);
39 OutIter ce = std::set_intersection(Iter1(ia), Iter1(ia+sa),
44 Iter2(ia), Iter2(ia+sa), OutIter(ic), std::less<int>());
|
| /external/libcxx/test/algorithms/alg.sorting/alg.set.operations/set.symmetric.difference/ |
| set_symmetric_difference.pass.cpp | 31 int ia[] = {1, 2, 2, 3, 3, 3, 4, 4, 4, 4}; local
32 const int sa = sizeof(ia)/sizeof(ia[0]);
38 OutIter ce = std::set_symmetric_difference(Iter1(ia), Iter1(ia+sa),
43 Iter2(ia), Iter2(ia+sa), OutIter(ic));
|
| set_symmetric_difference_comp.pass.cpp | 33 int ia[] = {1, 2, 2, 3, 3, 3, 4, 4, 4, 4}; local
34 const int sa = sizeof(ia)/sizeof(ia[0]);
40 OutIter ce = std::set_symmetric_difference(Iter1(ia), Iter1(ia+sa),
46 Iter2(ia), Iter2(ia+sa),
|
| /external/libcxx/test/algorithms/alg.sorting/alg.set.operations/set.union/ |
| set_union.pass.cpp | 30 int ia[] = {1, 2, 2, 3, 3, 3, 4, 4, 4, 4}; local
31 const int sa = sizeof(ia)/sizeof(ia[0]);
37 OutIter ce = std::set_union(Iter1(ia), Iter1(ia+sa),
42 Iter2(ia), Iter2(ia+sa), OutIter(ic));
|
| set_union_comp.pass.cpp | 32 int ia[] = {1, 2, 2, 3, 3, 3, 4, 4, 4, 4}; local
33 const int sa = sizeof(ia)/sizeof(ia[0]);
39 OutIter ce = std::set_union(Iter1(ia), Iter1(ia+sa),
44 Iter2(ia), Iter2(ia+sa), OutIter(ic), std::less<int>());
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/algorithms/alg.sorting/alg.set.operations/set.difference/ |
| set_difference.pass.cpp | 30 int ia[] = {1, 2, 2, 3, 3, 3, 4, 4, 4, 4}; local
31 const int sa = sizeof(ia)/sizeof(ia[0]);
37 OutIter ce = std::set_difference(Iter1(ia), Iter1(ia+sa),
44 Iter2(ia), Iter2(ia+sa), OutIter(ic));
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/algorithms/alg.sorting/alg.set.operations/set.intersection/ |
| set_intersection.pass.cpp | 30 int ia[] = {1, 2, 2, 3, 3, 3, 4, 4, 4, 4}; local
31 const int sa = sizeof(ia)/sizeof(ia[0]);
37 OutIter ce = std::set_intersection(Iter1(ia), Iter1(ia+sa),
42 Iter2(ia), Iter2(ia+sa), OutIter(ic));
|
