| /libcore/ojluni/src/test/java/util/stream/boottest/java/util/stream/ |
| NodeTest.java | 43 Integer[] array = new Integer[size]; local
44 for (int i = 0; i < array.length; i++) {
45 array[i] = i;
49 nodes.add(Nodes.node(array));
50 nodes.add(Nodes.node(Arrays.asList(array)));
51 nodes.add(degenerateTree(Arrays.asList(array).iterator()));
52 nodes.add(tree(Arrays.asList(array), l -> Nodes.node(l.toArray(new Integer[l.size()]))));
53 nodes.add(tree(Arrays.asList(array), l -> Nodes.node(l)));
54 nodes.add(fill(array, Nodes.builder(array.length, LambdaTestHelpers.integerArrayGenerator)))
102 assertEquals(n.asArray(LambdaTestHelpers.integerArrayGenerator), array); local
108 .asArray(LambdaTestHelpers.integerArrayGenerator), array); local
124 assertEquals(l.toArray(), array); local
[all...] |
| SpinedBufferTest.java | 65 int[] array = IntStream.range(0, size).toArray(); local
68 Arrays.stream(array).boxed().forEach(sb);
69 params.add(new Object[]{array, sb});
72 Arrays.stream(array).boxed().forEach(sb);
73 params.add(new Object[]{array, sb});
76 Arrays.stream(array).boxed().forEach(sb);
77 params.add(new Object[]{array, sb});
80 Arrays.stream(array).boxed().forEach(sb);
81 params.add(new Object[]{array, sb});
88 public void testSpliterator(int[] array, SpinedBuffer<Integer> sb)
138 Integer[] array = sb.asArray(LambdaTestHelpers.integerArrayGenerator); local
152 int[] array = IntStream.range(0, size).toArray(); local
213 int[] array = sb.asPrimitiveArray(); local
227 long[] array = LongStream.range(0, size).toArray(); local
288 long[] array = sb.asPrimitiveArray(); local
303 double[] array = LongStream.range(0, size).asDoubleStream().toArray(); local
364 double[] array = sb.asPrimitiveArray(); local
[all...] |
| /frameworks/base/core/java/com/android/internal/util/ |
| ArrayUtils.java | 27 import java.lang.reflect.Array;
82 * @param array1 the first byte array
83 * @param array2 the second byte array
107 * Returns an empty array of the specified type. The intent is that
108 * it will return the same empty array every time to avoid reallocation,
121 cache = Array.newInstance(kind, 0);
131 * Checks if given array is null or has zero elements.
133 public static boolean isEmpty(@Nullable Collection<?> array) {
134 return array == null || array.isEmpty()
295 int[] array = new int[list.size()]; local
304 long[] array = new long[intArray.length]; local
[all...] |
| /external/mockito/src/main/java/org/mockito/internal/matchers/ |
| ArrayEquals.java | 8 import java.lang.reflect.Array;
51 private String appendArray(Object[] array) {
54 for (int i = 0; i < array.length; i++) {
55 out.append(new Equals(array[i]).toString());
56 if (i != array.length - 1) {
64 public static Object[] createObjectArray(Object array) {
65 if (array instanceof Object[]) {
66 return (Object[]) array;
68 Object[] result = new Object[Array.getLength(array)];
[all...] |
| /external/tensorflow/tensorflow/contrib/reduce_slice_ops/python/kernel_tests/ |
| reduce_slice_ops_test.py | 31 x = np.array([1, 40, 700], dtype=np.int32)
32 indices = np.array([[0, 1], [0, 3], [1, 2], [1, 3], [0, 2]], dtype=np.int32)
33 result = np.array([1, 741, 40, 740, 41], dtype=np.int32)
39 x = np.array([[1, 2, 3], [40, 50, 60], [700, 800, 900]], dtype=np.int32)
40 indices = np.array([[0, 1], [0, 3], [1, 2], [1, 3], [0, 2]], dtype=np.int32)
41 result = np.array([[1, 2, 3], [741, 852, 963], [40, 50, 60],
48 x = np.array([[[1, 2], [3, 4]], [[50, 60], [70, 80]],
50 indices = np.array([[0, 1], [0, 3], [1, 2], [1, 3], [0, 2]], dtype=np.int32)
51 result = np.array([[[1, 2], [3, 4]],
61 x = np.transpose(np.array([[1, 2, 3], [40, 50, 60]
[all...] |
| /libcore/ojluni/src/main/java/java/util/stream/ |
| Nodes.java | 59 * The maximum size of an array that can be allocated.
64 static final String BAD_SIZE = "Stream size exceeds max array size";
131 * Produces a {@link Node} describing an array.
133 * <p>The node will hold a reference to the array and will not make a copy.
136 * @param array the array
137 * @return a node holding an array
139 static <T> Node<T> node(T[] array) {
140 return new ArrayNode<>(array);
162 * @param generator the array factor
324 P_OUT[] array = generator.apply((int) size); local
361 int[] array = new int[(int) size]; local
399 long[] array = new long[(int) size]; local
437 double[] array = new double[(int) size]; local
469 T[] array = generator.apply((int) size); local
495 int[] array = new int[(int) size]; local
521 long[] array = new long[(int) size]; local
547 double[] array = new double[(int) size]; local
639 final T[] array; field in class:Nodes.ArrayNode
805 T[] array = generator.apply((int) size); local
869 T_ARR array = newArray((int) size); local
[all...] |
| /art/test/706-checker-scheduler/src/ |
| Main.java | 40 /// CHECK: <<Array:i\d+>> IntermediateAddress
41 /// CHECK: <<ArrayGet1:i\d+>> ArrayGet [<<Array>>,<<i0>>]
44 /// CHECK: <<ArrayGet2:i\d+>> ArrayGet [<<Array>>,<<i1>>]
51 /// CHECK: <<Array:i\d+>> IntermediateAddress
52 /// CHECK: <<ArrayGet1:i\d+>> ArrayGet [<<Array>>,<<i0>>]
54 /// CHECK: <<ArrayGet2:i\d+>> ArrayGet [<<Array>>,<<i1>>]
60 int [] array = new int[10]; local
62 res += array[i];
63 res += array[i + 1];
76 /// CHECK: <<Array:i\d+>> IntermediateAddres
144 int [] array = {1, 2, 3, 4, 5, 6, 7, 8, 9, 10}; local
212 int [] array = {1, 2, 3, 4, 5, 6, 7, 8, 9, 10}; local
272 int [] array = {1, 2, 3, 4, 5, 6, 7, 8, 9, 10}; local
[all...] |
| /cts/tests/tests/jni/src/android/jni/cts/ |
| JniStaticTest.java | 148 short[] array = StaticNonce.returnShortArray(); local
149 assertSame(short[].class, array.getClass());
150 assertEquals(3, array.length);
151 assertEquals(10, array[0]);
152 assertEquals(20, array[1]);
153 assertEquals(30, array[2]);
160 String[] array = StaticNonce.returnStringArray(); local
161 assertSame(String[].class, array.getClass());
162 assertEquals(100, array.length);
163 assertEquals("blort", array[0])
[all...] |
| /external/guava/guava-tests/benchmark/com/google/common/base/ |
| StringsRepeatBenchmark.java | 69 char[] array = new char[len * count]; local
75 System.arraycopy(strCopy, 0, array, pos,strCopyLen);
84 return new String(array);
92 char[] array = new char[size]; local
94 string.getChars(0, len, array, i);
96 return new String(array);
102 final char[] array = new char[size]; local
103 string.getChars(0, len, array, 0);
106 System.arraycopy(array, 0, array, n, n)
[all...] |
| /frameworks/base/core/java/android/bluetooth/le/ |
| BluetoothLeUtils.java | 38 static String toString(SparseArray<byte[]> array) {
39 if (array == null) {
42 if (array.size() == 0) {
47 for (int i = 0; i < array.size(); ++i) {
48 buffer.append(array.keyAt(i)).append("=").append(Arrays.toString(array.valueAt(i)));
82 static boolean equals(SparseArray<byte[]> array, SparseArray<byte[]> otherArray) {
83 if (array == otherArray) {
86 if (array == null || otherArray == null) {
89 if (array.size() != otherArray.size())
[all...] |
| /external/v8/src/js/ |
| array.js | 16 var GlobalArray = global.Array;
37 function ArraySpeciesCreate(array, length) {
39 var constructor = %ArraySpeciesConstructor(array);
48 function GetSortedArrayKeys(array, indices) {
54 var e = array[i];
55 if (!IS_UNDEFINED(e) || i in array) {
65 function SparseJoinWithSeparatorJS(array, keys, length, use_locale, separator) {
71 elements[i * 2 + 1] = ConvertToString(use_locale, array[key]);
78 function SparseJoin(array, keys, use_locale) {
82 elements[i] = ConvertToString(use_locale, array[keys[i]])
[all...] |
| /external/mesa3d/src/mesa/main/ |
| formats.csv | 37 # - channel encoding (only meaningful for array or packed layout), containing for each
103 # Array normalized formats
104 MESA_FORMAT_A_UNORM8 , array , 1, 1, 1, un8 , , , , 000x, rgb
105 MESA_FORMAT_A_UNORM16 , array , 1, 1, 1, un16, , , , 000x, rgb
106 MESA_FORMAT_L_UNORM8 , array , 1, 1, 1, un8 , , , , xxx1, rgb
107 MESA_FORMAT_L_UNORM16 , array , 1, 1, 1, un16, , , , xxx1, rgb
108 MESA_FORMAT_I_UNORM8 , array , 1, 1, 1, un8 , , , , xxxx, rgb
109 MESA_FORMAT_I_UNORM16 , array , 1, 1, 1, un16, , , , xxxx, rgb
110 MESA_FORMAT_R_UNORM8 , array , 1, 1, 1, un8 , , , , x001, rgb
111 MESA_FORMAT_R_UNORM16 , array , 1, 1, 1, un16, , , , x001, rg
[all...] |
| /external/skia/bench/ |
| SortBench.cpp | 17 static void rand_proc(int array[N]) {
20 array[i] = rand.nextS();
24 static void randN_proc(int array[N]) {
28 array[i] = rand.nextU() % mod;
32 static void forward_proc(int array[N]) {
34 array[i] = i;
38 static void backward_proc(int array[N]) {
40 array[i] = -i;
44 static void same_proc(int array[N]) {
46 array[i] = N
[all...] |
| /external/skqp/bench/ |
| SortBench.cpp | 17 static void rand_proc(int array[N]) {
20 array[i] = rand.nextS();
24 static void randN_proc(int array[N]) {
28 array[i] = rand.nextU() % mod;
32 static void forward_proc(int array[N]) {
34 array[i] = i;
38 static void backward_proc(int array[N]) {
40 array[i] = -i;
44 static void same_proc(int array[N]) {
46 array[i] = N
[all...] |
| /external/caliper/tutorial/ |
| Tutorial.java | 87 * Let's try iterating over a large array. This seems simple enough, but
91 private final int[] array = new int[1000000]; field in class:Tutorial.Benchmark3
96 for (int ignoreMe : array) {}
128 private final int[] array = new int[1000000]; field in class:Tutorial.Benchmark4
133 for (int doNotIgnoreMe : array) {
171 private int[] array; // set by us, in setUp() field in class:Tutorial.Benchmark5
175 array = new int[size];
181 for (int doNotIgnoreMe : array) {
|
| /external/libcxx/test/std/utilities/tuple/tuple.tuple/tuple.helper/ |
| tuple.include.array.pass.cpp | 24 #include <array>
46 test<std::array<int, 5>, 5, int, 0>();
47 test<std::array<int, 5>, 5, int, 1>();
48 test<std::array<const char *, 4>, 4, const char *, 3>();
49 test<std::array<volatile int, 4>, 4, volatile int, 3>();
50 test<std::array<char *, 3>, 3, char *, 1>();
51 test<std::array<char *, 3>, 3, char *, 2>();
|
| /external/tensorflow/tensorflow/contrib/data/python/kernel_tests/ |
| concatenate_dataset_op_test.py | 31 input_components = (np.tile(np.array([[1], [2], [3], [4]]), 20),
32 np.tile(np.array([[12], [13], [14], [15]]), 4))
34 np.array([[5], [6], [7], [8], [9]]), 20), var_array)
41 array = np.tile(np.array([[16], [17], [18], [19], [20]]), 15)
42 diff_array = np.array([[1], [2], [3], [4], [5]])
43 self.run_core_tests(lambda: self._build_concatenate_dataset(array),
|
| /external/tensorflow/tensorflow/contrib/lite/toco/graph_transformations/ |
| dequantize.cc | 31 void DequantizeBuffer(Array* array) {
32 const auto old_data = array->GetBuffer<A>().data;
33 array->buffer = nullptr;
34 array->data_type = ArrayDataType::kFloat;
35 auto& new_data = array->GetMutableBuffer<ArrayDataType::kFloat>().data;
37 const auto& qparams = array->GetQuantizationParams();
56 auto* array = &model->GetArray(array_name); local
57 CHECK(array->quantization_params);
60 auto& qparams = *array->quantization_params
80 auto* array = &model->GetArray(array_name); local
[all...] |
| /libcore/harmony-tests/src/test/java/org/apache/harmony/tests/java/nio/ |
| WrappedByteBufferTest.java | 40 byte array[] = new byte[BUFFER_LENGTH];
42 ByteBuffer.wrap(array, -1, 0);
48 ByteBuffer.wrap(array, BUFFER_LENGTH + 1, 0);
54 ByteBuffer.wrap(array, 0, -1);
60 ByteBuffer.wrap(array, 0, BUFFER_LENGTH + 1);
66 ByteBuffer.wrap(array, 1, Integer.MAX_VALUE);
72 ByteBuffer.wrap(array, Integer.MAX_VALUE, 1);
|
| /prebuilts/ndk/r16/sources/cxx-stl/llvm-libc++/test/std/utilities/tuple/tuple.tuple/tuple.helper/ |
| tuple.include.array.pass.cpp | 24 #include <array>
46 test<std::array<int, 5>, 5, int, 0>();
47 test<std::array<int, 5>, 5, int, 1>();
48 test<std::array<const char *, 4>, 4, const char *, 3>();
49 test<std::array<volatile int, 4>, 4, volatile int, 3>();
50 test<std::array<char *, 3>, 3, char *, 1>();
51 test<std::array<char *, 3>, 3, char *, 2>();
|
| /libcore/ojluni/src/main/java/java/util/concurrent/ |
| PriorityBlockingQueue.java | 114 * The implementation uses an array-based binary heap, with public
130 * Default array capacity.
135 * The maximum size of array to allocate.
136 * Some VMs reserve some header words in an array.
138 * OutOfMemoryError: Requested array size exceeds VM limit
280 * Tries to grow array to accommodate at least one more element
285 * @param array the heap array
286 * @param oldCap the length of the array
288 private void tryGrow(Object[] array, int oldCap)
326 Object[] array = queue; local
437 Object[] array = queue; local
482 Object[] array; local
613 Object[] array = queue; local
626 Object[] array = queue; local
680 Object[] array = queue; local
759 Object[] array = queue; local
862 final Object[] array; \/\/ Array of all elements field in class:PriorityBlockingQueue.Itr
937 Object[] array; field in class:PriorityBlockingQueue.PBQSpliterator
[all...] |
| /external/libcxx/test/std/algorithms/alg.sorting/alg.sort/partial.sort/ |
| partial_sort_comp.pass.cpp | 42 int* array = new int[N]; local
44 array[i] = i;
45 std::shuffle(array, array+N, randomness);
46 std::partial_sort(array, array+M, array+N, std::greater<int>());
50 assert(array[i] == N-i-1);
52 delete [] array;
|
| /external/mesa3d/src/mesa/state_tracker/ |
| st_atom_array.c | 31 * This converts the VBO's vertex attribute/array information into
344 const struct gl_vertex_array *array; local
348 array = get_client_array(vp, arrays, attr);
349 if (!array)
352 stride = array->StrideB; /* in bytes */
353 bufObj = array->BufferObj;
355 /* save info about the first array */
357 firstPtr = array->Ptr;
369 if (llabs(array->Ptr - firstPtr) > firstStride)
464 const struct gl_vertex_array *array; local
498 const struct gl_vertex_array *array; local
575 const struct gl_vertex_array *array; local
[all...] |
| /prebuilts/ndk/r16/sources/cxx-stl/llvm-libc++/test/std/algorithms/alg.sorting/alg.sort/partial.sort/ |
| partial_sort_comp.pass.cpp | 42 int* array = new int[N]; local
44 array[i] = i;
45 std::shuffle(array, array+N, randomness);
46 std::partial_sort(array, array+M, array+N, std::greater<int>());
50 assert(array[i] == N-i-1);
52 delete [] array;
|
| /art/test/530-checker-regression-reftyp-final/src/ |
| Main.java | 37 // Bug #1: RTP would set the type of `array` to exact Object[]. Instruction
39 Object[] array = $noinline$getArray(); local
40 expectTrue = array instanceof MyClassA[];
46 // for `array` would be again set to exact MyClassA[] and incorrectly
48 expectTrue = array instanceof MyClassB[];
|
