| /prebuilts/ndk/r16/sources/cxx-stl/llvm-libc++/test/std/algorithms/alg.modifying.operations/alg.fill/ |
| fill.pass.cpp | 40 int ia[n] = {0}; local
41 std::fill(Iter(ia), Iter(ia+n), 1);
42 assert(ia[0] == 1);
43 assert(ia[1] == 1);
44 assert(ia[2] == 1);
45 assert(ia[3] == 1);
|
| /external/libcxx/test/std/numerics/numeric.ops/transform.reduce/ |
| transform_reduce_iter_iter_iter_init.pass.cpp | 38 int ia[] = {1, 2, 3, 4, 5, 6}; local
40 unsigned sa = sizeof(ia) / sizeof(ia[0]);
43 test(SIter(ia), SIter(ia), UIter(ua), 0, 0);
44 test(UIter(ua), UIter(ua), SIter(ia), 1, 1);
45 test(SIter(ia), SIter(ia+1), UIter(ua), 0, 2);
46 test(UIter(ua), UIter(ua+1), SIter(ia), 2, 4);
47 test(SIter(ia), SIter(ia+2), UIter(ua), 0, 10)
63 MoveOnly ia[] = {{1}, {2}, {3}}; local
[all...] |
| /external/libcxx/test/std/algorithms/alg.nonmodifying/mismatch/ |
| mismatch.pass.cpp | 29 int ia[] = {1, 3, 6, 7}; local
35 auto p1 = std::mismatch(std::begin(ia), std::end(ia), std::begin(ic));
36 if (p1.first != ia+2 || p1.second != ic+2)
39 auto p2 = std::mismatch(std::begin(ia), std::end(ia), std::begin(ic), std::end(ic));
40 if (p2.first != ia+2 || p2.second != ic+2)
64 int ia[] = {0, 1, 2, 2, 0, 1, 2, 3}; local
65 const unsigned sa = sizeof(ia)/sizeof(ia[0])
[all...] |
| mismatch_pred.pass.cpp | 34 int ia[] = {1, 3, 6, 7}; local
40 auto p1 = std::mismatch(std::begin(ia), std::end(ia), std::begin(ic), eq);
41 if (p1.first != ia+2 || p1.second != ic+2)
44 auto p2 = std::mismatch(std::begin(ia), std::end(ia), std::begin(ic), std::end(ic), eq);
45 if (p2.first != ia+2 || p2.second != ic+2)
74 int ia[] = {0, 1, 2, 2, 0, 1, 2, 3}; local
75 const unsigned sa = sizeof(ia)/sizeof(ia[0])
[all...] |
| /prebuilts/ndk/r16/sources/cxx-stl/llvm-libc++/test/std/algorithms/alg.nonmodifying/alg.search/ |
| search_n.pass.cpp | 27 int ia[] = {0, 1, 2, 3, 4, 5}; local
28 const unsigned sa = sizeof(ia)/sizeof(ia[0]);
29 assert(std::search_n(Iter(ia), Iter(ia+sa), 0, 0) == Iter(ia));
30 assert(std::search_n(Iter(ia), Iter(ia+sa), 1, 0) == Iter(ia+0));
31 assert(std::search_n(Iter(ia), Iter(ia+sa), 2, 0) == Iter(ia+sa))
[all...] |
| /external/sqlite/android/ |
| OldPhoneNumberUtils.cpp | 170 int ia, ib; local
179 ia = strlen(a);
181 if (ia == 0 || ib == 0) {
186 ia--;
191 while (ia >= 0 && ib >=0) {
195 ca = a[ia];
198 ia--;
215 ia--; ib--; matched++;
233 if (matched >= MIN_MATCH && (ia < 0 || ib < 0)) {
246 if (matchIntlPrefix(a, ia + 1) && matchIntlPrefix(b, ib + 1))
[all...] |
| /external/libcxx/test/std/algorithms/alg.nonmodifying/alg.search/ |
| search_n_pred.pass.cpp | 28 int ia[] = {0, 0, 1, 1, 2, 2}; local
29 return (std::search_n(std::begin(ia), std::end(ia), 1, 0, eq) == ia)
30 && (std::search_n(std::begin(ia), std::end(ia), 2, 1, eq) == ia+2)
31 && (std::search_n(std::begin(ia), std::end(ia), 1, 3, eq) == std::end(ia))
51 int ia[] = {0, 1, 2, 3, 4, 5}; local
[all...] |
| /external/libcxx/test/std/algorithms/alg.nonmodifying/alg.find.end/ |
| find_end_pred.pass.cpp | 34 int ia[] = {0, 1, 2}; local
41 return (std::find_end(FI(std::begin(ic)), FI(std::end(ic)), FI(std::begin(ia)), FI(std::end(ia)), eq) == FI(ic+15))
43 && (std::find_end(BI(std::begin(ic)), BI(std::end(ic)), BI(std::begin(ia)), BI(std::end(ia)), eq) == BI(ic+15))
45 && (std::find_end(RI(std::begin(ic)), RI(std::end(ic)), RI(std::begin(ia)), RI(std::end(ia)), eq) == RI(ic+15))
57 int ia[] = {0, 1, 2, 3, 4, 5, 0, 1, 2, 3, 4, 0, 1, 2, 3, 0, 1, 2, 0, 1, 0}; local
58 const unsigned sa = sizeof(ia)/sizeof(ia[0])
[all...] |
| /external/mesa3d/src/gallium/auxiliary/draw/ |
| draw_prim_assembler.h | 55 draw_prim_assembler_destroy(struct draw_assembler *ia);
71 draw_prim_assembler_prepare_outputs(struct draw_assembler *ia);
74 draw_prim_assembler_new_instance(struct draw_assembler *ia);
|
| /external/libcxx/test/std/algorithms/alg.modifying.operations/alg.reverse/ |
| reverse.pass.cpp | 26 int ia[] = {0}; local
27 const unsigned sa = sizeof(ia)/sizeof(ia[0]);
28 std::reverse(Iter(ia), Iter(ia));
29 assert(ia[0] == 0);
30 std::reverse(Iter(ia), Iter(ia+sa));
31 assert(ia[0] == 0);
|
| reverse_copy.pass.cpp | 24 int ia[] = {1, 3, 5, 2, 5, 6}; local
25 int ib[std::size(ia)] = {0};
27 auto it = std::reverse_copy(std::begin(ia), std::end(ia), std::begin(ib));
29 return std::distance(std::begin(ib), it) == std::size(ia)
30 && std::equal (std::begin(ia), std::end(ia), std::rbegin(ib))
39 const int ia[] = {0}; local
40 const unsigned sa = sizeof(ia)/sizeof(ia[0])
[all...] |
| /external/libcxx/test/std/algorithms/alg.sorting/alg.merge/ |
| inplace_merge.pass.cpp | 54 value_type* ia = new value_type[N]; local
56 ia[i] = i;
57 std::shuffle(ia, ia+N, randomness);
58 std::sort(ia, ia+M);
59 std::sort(ia+M, ia+N);
60 std::inplace_merge(Iter(ia), Iter(ia+M), Iter(ia+N))
[all...] |
| inplace_merge_comp.pass.cpp | 70 value_type* ia = new value_type[N]; local
72 ia[i] = i;
73 std::shuffle(ia, ia+N, randomness);
74 std::sort(ia, ia+M, std::greater<value_type>());
75 std::sort(ia+M, ia+N, std::greater<value_type>());
77 std::inplace_merge(Iter(ia), Iter(ia+M), Iter(ia+N), std::ref(pred))
153 std::unique_ptr<int>* ia = new std::unique_ptr<int>[N]; local
[all...] |
| /prebuilts/ndk/r16/sources/cxx-stl/llvm-libc++/test/std/algorithms/alg.modifying.operations/alg.reverse/ |
| reverse.pass.cpp | 26 int ia[] = {0}; local
27 const unsigned sa = sizeof(ia)/sizeof(ia[0]);
28 std::reverse(Iter(ia), Iter(ia));
29 assert(ia[0] == 0);
30 std::reverse(Iter(ia), Iter(ia+sa));
31 assert(ia[0] == 0);
|
| /prebuilts/ndk/r16/sources/cxx-stl/llvm-libc++/test/std/algorithms/alg.sorting/alg.merge/ |
| inplace_merge.pass.cpp | 54 value_type* ia = new value_type[N]; local
56 ia[i] = i;
57 std::shuffle(ia, ia+N, randomness);
58 std::sort(ia, ia+M);
59 std::sort(ia+M, ia+N);
60 std::inplace_merge(Iter(ia), Iter(ia+M), Iter(ia+N))
[all...] |
| /external/libcxx/test/std/algorithms/alg.nonmodifying/alg.find.first.of/ |
| find_first_of_pred.pass.cpp | 27 int ia[] = {1, 2, 3}; local
34 return (std::find_first_of(FI(std::begin(ic)), FI(std::end(ic)), FI(std::begin(ia)), FI(std::end(ia)), eq) == FI(ic+1))
36 && (std::find_first_of(BI(std::begin(ic)), BI(std::end(ic)), BI(std::begin(ia)), BI(std::end(ia)), eq) == BI(ic+1))
38 && (std::find_first_of(RI(std::begin(ic)), RI(std::end(ic)), RI(std::begin(ia)), RI(std::end(ia)), eq) == RI(ic+1))
46 int ia[] = {0, 1, 2, 3, 0, 1, 2, 3}; local
47 const unsigned sa = sizeof(ia)/sizeof(ia[0])
[all...] |
| /prebuilts/ndk/r16/sources/cxx-stl/llvm-libc++/test/std/numerics/numeric.ops/transform.reduce/ |
| transform_reduce_iter_iter_iter_init.pass.cpp | 36 int ia[] = {1, 2, 3, 4, 5, 6}; local
38 unsigned sa = sizeof(ia) / sizeof(ia[0]);
41 test(SIter(ia), SIter(ia), UIter(ua), 0, 0);
42 test(UIter(ua), UIter(ua), SIter(ia), 1, 1);
43 test(SIter(ia), SIter(ia+1), UIter(ua), 0, 2);
44 test(UIter(ua), UIter(ua+1), SIter(ia), 2, 4);
45 test(SIter(ia), SIter(ia+2), UIter(ua), 0, 10)
[all...] |
| /external/libcxx/test/std/algorithms/alg.modifying.operations/alg.fill/ |
| fill_n.pass.cpp | 57 int ia[n] = {0};
58 assert(std::fill_n(Iter(ia), UDI(n), 1) == std::next(Iter(ia), n));
59 assert(ia[0] == 1);
60 assert(ia[1] == 1);
61 assert(ia[2] == 1);
62 assert(ia[3] == 1);
69 int ia[n] = {0};
70 assert(std::fill_n(ia, UDI(n), static_cast<char>(1)) == std::next(ia, n))
[all...] |
| /external/slf4j/slf4j-ext/src/main/java/org/slf4j/instrumentation/ |
| ToStringHelper.java | 130 int[] ia = (int[]) o; local
131 for (int i = 0; i < ia.length; i++) {
135 sb.append(ia[i]);
139 long[] ia = (long[]) o; local
140 for (int i = 0; i < ia.length; i++) {
144 sb.append(ia[i]);
147 double[] ia = (double[]) o; local
148 for (int i = 0; i < ia.length; i++) {
152 sb.append(ia[i]);
155 float[] ia = (float[]) o local
163 char[] ia = (char[]) o; local
171 short[] ia = (short[]) o; local
[all...] |
| /art/test/527-checker-array-access-simd/src/ |
| Main.java | 213 int[] ia = new int[ARRAY_SIZE]; local
216 checkSingleAccess(ia);
217 checkIntCase(ia);
219 checkInt2Float(ia, fa);
221 assertIntEquals(3200, calcArraySum(ia, ba, fa));
|
| /external/libcxx/test/std/algorithms/alg.modifying.operations/alg.copy/ |
| copy_backward.pass.cpp | 26 // int ia[] = {1, 2, 3, 4, 5};
29 // size_t N = std::size(ia);
30 // auto p = std::copy_backward(std::begin(ia), std::end(ia), std::begin(ic) + N);
31 // return std::equal(std::begin(ic), p, std::begin(ia))
42 int ia[N]; local
44 ia[i] = i;
47 OutIter r = std::copy_backward(InIter(ia), InIter(ia+N), OutIter(ib+N));
50 assert(ia[i] == ib[i])
[all...] |
| /frameworks/av/media/libstagefright/codecs/amrnb/dec/src/ |
| d8_31pf.cpp | 172 Word16 ia; local
188 ia =
196 ia,
201 ia = (Word16)(MSBs - (tempWord32 >> 1));
204 ia,
214 ib = ia - (Word16)(tempWord32 >> 1);
231 ia,
350 Word16 ia; local
420 ia =
427 ia += 12
[all...] |
| /prebuilts/ndk/r16/sources/cxx-stl/llvm-libc++/test/std/algorithms/alg.modifying.operations/alg.copy/ |
| copy_backward.pass.cpp | 27 int ia[N]; local
29 ia[i] = i;
32 OutIter r = std::copy_backward(InIter(ia), InIter(ia+N), OutIter(ib+N));
35 assert(ia[i] == ib[i]);
|
| /prebuilts/ndk/r16/sources/cxx-stl/llvm-libc++/test/std/experimental/algorithms/alg.random.sample/ |
| sample.pass.cpp | 54 PopulationItem ia[] = {1, 2, 3, 4, 5, 6, 7, 8, 9, 10}; local
55 const unsigned is = sizeof(ia) / sizeof(ia[0]);
66 end = std::experimental::sample(PopulationIterator(ia),
67 PopulationIterator(ia + is),
73 end = std::experimental::sample(PopulationIterator(ia),
74 PopulationIterator(ia + is),
85 PopulationItem ia[] = {42}; local
90 std::experimental::sample(PopulationIterator(ia), PopulationIterator(ia),
100 PopulationItem ia[] = {1, 2, 3, 4, 5, 6, 7, 8, 9, 10}; local
116 PopulationItem ia[] = {1, 2, 3, 4, 5}; local
[all...] |
| /external/libcxx/test/std/algorithms/alg.modifying.operations/alg.remove/ |
| remove_copy.pass.cpp | 25 int ia[] = {1, 3, 5, 2, 5, 6}; local
26 int ib[std::size(ia)] = {0};
28 auto it = std::remove_copy(std::begin(ia), std::end(ia), std::begin(ib), 5);
30 return std::distance(std::begin(ib), it) == (std::size(ia) - 2) // we removed two elements
41 int ia[] = {0, 1, 2, 3, 4, 2, 3, 4, 2};
42 const unsigned sa = sizeof(ia)/sizeof(ia[0]);
44 OutIter r = std::remove_copy(InIter(ia), InIter(ia+sa), OutIter(ib), 2)
[all...] |
