| /libcore/harmony-tests/src/test/java/org/apache/harmony/tests/java/nio/ |
| IntBufferTest.java | 51 int array[] = buf.array(); local
52 assertContentEquals(buf, array, buf.arrayOffset(), buf.capacity());
54 loadTestData1(array, buf.arrayOffset(), buf.capacity());
55 assertContentEquals(buf, array, buf.arrayOffset(), buf.capacity());
57 loadTestData2(array, buf.arrayOffset(), buf.capacity());
58 assertContentEquals(buf, array, buf.arrayOffset(), buf.capacity());
61 assertContentEquals(buf, array, buf.arrayOffset(), buf.capacity());
64 assertContentEquals(buf, array, buf.arrayOffset(), buf.capacity());
68 int array[] = buf.array() local
257 int array[] = new int[1]; local
284 int array[] = new int[buf.capacity()]; local
416 int array[] = new int[1]; local
445 int array[] = new int[buf.capacity()]; local
631 assertEquals(buf.get(i), array[offset + i]); local
[all...] |
| DoubleBufferTest.java | 75 double array[] = buf.array(); local
76 assertContentEquals(buf, array, buf.arrayOffset(), buf.capacity());
78 loadTestData1(array, buf.arrayOffset(), buf.capacity());
79 assertContentEquals(buf, array, buf.arrayOffset(), buf.capacity());
81 loadTestData2(array, buf.arrayOffset(), buf.capacity());
82 assertContentEquals(buf, array, buf.arrayOffset(), buf.capacity());
85 assertContentEquals(buf, array, buf.arrayOffset(), buf.capacity());
88 assertContentEquals(buf, array, buf.arrayOffset(), buf.capacity());
92 double array[] = buf.array() local
287 double array[] = new double[1]; local
308 double array[] = new double[buf.capacity()]; local
440 double array[] = new double[1]; local
463 double array[] = new double[buf.capacity()]; local
645 assertEquals(buf.get(i), array[offset + i], 0.01); local
[all...] |
| ShortBufferTest.java | 50 short array[] = buf.array(); local
51 assertContentEquals(buf, array, buf.arrayOffset(), buf.capacity());
53 loadTestData1(array, buf.arrayOffset(), buf.capacity());
54 assertContentEquals(buf, array, buf.arrayOffset(), buf.capacity());
56 loadTestData2(array, buf.arrayOffset(), buf.capacity());
57 assertContentEquals(buf, array, buf.arrayOffset(), buf.capacity());
60 assertContentEquals(buf, array, buf.arrayOffset(), buf.capacity());
63 assertContentEquals(buf, array, buf.arrayOffset(), buf.capacity());
67 short array[] = buf.array() local
256 short array[] = new short[1]; local
277 short array[] = new short[buf.capacity()]; local
403 short array[] = new short[1]; local
432 short array[] = new short[buf.capacity()]; local
618 assertEquals(buf.get(i), array[offset + i]); local
[all...] |
| /external/icu/icu4c/source/common/ |
| uarrsort.cpp | 69 uprv_stableBinarySearch(char *array, int32_t limit, void *item, int32_t itemSize,
74 /* Binary search until we get down to a tiny sub-array. */
77 int32_t diff=cmp(context, item, array+i*itemSize);
99 /* Linear search over the remaining tiny sub-array. */
101 int32_t diff=cmp(context, item, array+start*itemSize);
113 doInsertionSort(char *array, int32_t length, int32_t itemSize,
118 char *item=array+j*itemSize;
119 int32_t insertionPoint=uprv_stableBinarySearch(array, j, item, itemSize, cmp, context);
126 char *dest=array+insertionPoint*itemSize;
127 uprv_memcpy(pv, item, itemSize); /* v=array[j] *
[all...] |
| /external/compiler-rt/lib/asan/tests/ |
| asan_interface_test.cc | 30 char *array = Ident((char*)malloc(kArraySize)); local
35 EXPECT_EQ(true, __sanitizer_get_ownership(array));
36 EXPECT_EQ(kArraySize, __sanitizer_get_allocated_size(array));
46 EXPECT_FALSE(__sanitizer_get_ownership(array + kArraySize / 2));
47 EXPECT_DEATH(__sanitizer_get_allocated_size(array + kArraySize / 2),
57 free(array);
58 EXPECT_FALSE(__sanitizer_get_ownership(array));
59 EXPECT_DEATH(__sanitizer_get_allocated_size(array),
76 char *array; local
80 array = Ident((char*)malloc(kMallocSize))
163 char *array = Ident((char*)malloc(120)); local
181 char *array = Ident((char*)malloc(120)); local
371 char *array = Ident((char*)malloc(120)); local
[all...] |
| /external/eigen/test/ |
| array_for_matrix.cpp | 33 VERIFY_IS_APPROX(m1.array() + s1, s1 + m1.array());
34 VERIFY_IS_APPROX((m1.array() + s1).matrix(), MatrixType::Constant(rows,cols,s1) + m1);
35 VERIFY_IS_APPROX(((m1*Scalar(2)).array() - s2).matrix(), (m1+m1) - MatrixType::Constant(rows,cols,s2) );
37 m3.array() += s2;
38 VERIFY_IS_APPROX(m3, (m1.array() + s2).matrix());
40 m3.array() -= s1;
41 VERIFY_IS_APPROX(m3, (m1.array() - s1).matrix());
65 const Scalar& ref_m1 = m.matrix().array().coeffRef(0);
66 const Scalar& ref_m2 = m.matrix().array().coeffRef(0,0)
[all...] |
| /art/test/595-error-class/smali/ |
| merge.smali | 25 new-array v0, v0, [LAnError;
28 new-array v0, v0, [Ljava/lang/Integer;
|
| /external/apache-harmony/support/src/test/java/tests/support/ |
| Support_Proxy_I1.java | 23 int[] array(long[] f); method in interface:Support_Proxy_I1
|
| /external/clang/test/Analysis/ |
| misc-ps-cxx0x.cpp | 52 int array[2] = { 1, 2 }; local
54 for ( int i : array )
61 int array[2] = { 1, 2 }; local
63 for (int i : array)
|
| /external/clang/test/CodeGen/ |
| 2009-03-08-ZeroEltStructCrash.c | 10 int *array = u->contents.zero_arr; local
|
| sanitize-init-order.cpp | 35 const volatile PODWithCtor array[5][5]; member in namespace:NS
|
| /external/eigen/doc/snippets/ |
| PartialRedux_count.cpp | 3 Matrix<ptrdiff_t, 3, 1> res = (m.array() >= 0.5).rowwise().count();
|
| /external/guava/guava/src/com/google/common/primitives/ |
| UnsignedBytes.java | 127 * Returns the least value present in {@code array}.
129 * @param array a <i>nonempty</i> array of {@code byte} values
130 * @return the value present in {@code array} that is less than or equal to
131 * every other value in the array
132 * @throws IllegalArgumentException if {@code array} is empty
134 public static byte min(byte... array) {
135 checkArgument(array.length > 0);
136 int min = toInt(array[0]);
137 for (int i = 1; i < array.length; i++)
[all...] |
| UnsignedInts.java | 79 * Returns the least value present in {@code array}, treating values as unsigned.
81 * @param array a <i>nonempty</i> array of unsigned {@code int} values
82 * @return the value present in {@code array} that is less than or equal to every other value in
83 * the array according to {@link #compare}
84 * @throws IllegalArgumentException if {@code array} is empty
86 public static int min(int... array) {
87 checkArgument(array.length > 0);
88 int min = flip(array[0]);
89 for (int i = 1; i < array.length; i++)
[all...] |
| /external/guava/guava-testlib/src/com/google/common/collect/testing/testers/ |
| ListCreationTester.java | 39 E[] array = createSamplesArray(); local
40 array[1] = samples.e0;
41 collection = getSubjectGenerator().create(array);
43 expectContents(array);
|
| /external/libcups/cups/ |
| array-private.h | 2 * Private array definitions for CUPS.
22 # include <cups/array.h>
|
| /external/libcxx/test/std/utilities/tuple/tuple.tuple/tuple.helper/ |
| tuple_size_v.pass.cpp | 18 #include <array>
35 test<std::array<int, 1>, 1>();
39 test<std::array<int, 2>, 2>();
42 test<std::array<int, 3>, 3>();
|
| /external/oj-libjdwp/src/share/back/ |
| ArrayReferenceImpl.c | 37 jarray array = inStream_readArrayRef(env, in); local
42 arrayLength = JNI_FUNC_PTR(env,GetArrayLength)(env, array);
71 jarray array, jint index, jint length)
78 JNI_FUNC_PTR(env,GetBooleanArrayRegion)(env, array, index, length, components);
88 jarray array, jint index, jint length)
95 JNI_FUNC_PTR(env,GetByteArrayRegion)(env, array, index, length, components);
105 jarray array, jint index, jint length)
112 JNI_FUNC_PTR(env,GetCharArrayRegion)(env, array, index, length, components);
122 jarray array, jint index, jint length)
129 JNI_FUNC_PTR(env,GetShortArrayRegion)(env, array, index, length, components)
233 jarray array; local
481 jarray array; local
[all...] |
| /external/puffin/src/ |
| sample_generator.h | 16 void PrintArray(const std::string& name, const Buffer& array);
|
| /external/replicaisland/src/com/replica/replicaisland/ |
| Sorter.java | 22 public abstract void sort(Type[] array, int count, Comparator<Type> comparator);
|
| /external/skia/src/core/ |
| SkTSort.h | 27 /* Sifts a broken heap. The input array is a heap from root to bottom
30 * Sinks a hole from array[root] to leaf and then sifts the original array[root] element
38 * @param root the one based index into array of the out-of-place root of the heap.
39 * @param bottom the one based index in the array of the last entry in the heap.
42 void SkTHeapSort_SiftUp(T array[], size_t root, size_t bottom, C lessThan) {
43 T x = array[root-1];
47 if (j < bottom && lessThan(array[j-1], array[j])) {
50 array[root-1] = array[j-1]
[all...] |
| /external/skqp/src/core/ |
| SkTSort.h | 27 /* Sifts a broken heap. The input array is a heap from root to bottom
30 * Sinks a hole from array[root] to leaf and then sifts the original array[root] element
38 * @param root the one based index into array of the out-of-place root of the heap.
39 * @param bottom the one based index in the array of the last entry in the heap.
42 void SkTHeapSort_SiftUp(T array[], size_t root, size_t bottom, C lessThan) {
43 T x = array[root-1];
47 if (j < bottom && lessThan(array[j-1], array[j])) {
50 array[root-1] = array[j-1]
[all...] |
| /external/tensorflow/tensorflow/compiler/xla/tests/ |
| custom_call_test.cc | 44 float* array = in[0]; local
45 *out = array[0] + array[1] + array[2] + array[3];
50 float* array = in[0]; local
51 out[0] = array[0] + 1;
52 out[1] = array[1] + 1;
53 out[2] = array[2] + 1;
54 out[3] = array[3] + 1
[all...] |
| /external/tensorflow/tensorflow/contrib/lite/toco/graph_transformations/ |
| resolve_pad_attributes.cc | 38 const auto& array = model->GetArray(op->inputs[1]); local
39 if (!array.has_shape()) return false;
41 const std::vector<int>& dims = array.shape().dims();
44 std::vector<int> buffer = array.GetBuffer<ArrayDataType::kInt32>().data;
|
| /libcore/luni/src/main/java/libcore/internal/ |
| StringPool.java | 41 * Returns a string equal to {@code new String(array, start, length)}.
43 public String get(char[] array, int start, int length) {
47 hashCode = (hashCode * 31) + array[i];
56 if (pooled != null && contentEquals(pooled, array, start, length)) {
60 String result = new String(array, start, length);
|
