Searched defs:array (Results 51 - 73 of 73) sorted by relevance

123

/libcore/ojluni/src/test/java/util/stream/bootlib/java/util/stream/
H A DTestData.java78 public static <T> OfRef<T> ofArray(String name, T[] array) { argument
79 return new AbstractTestData.RefTestData<>(name, array, Arrays::stream, a -> Arrays.stream(a).parallel(),
113 public static <T> OfInt ofArray(String name, int[] array) { argument
114 return new AbstractTestData.IntTestData<>(name, array, Arrays::stream, a -> Arrays.stream(a).parallel(),
144 public static <T> OfLong ofArray(String name, long[] array) { argument
145 return new AbstractTestData.LongTestData<>(name, array, Arrays::stream, a -> Arrays.stream(a).parallel(),
175 public static <T> OfDouble ofArray(String name, double[] array) { argument
176 return new AbstractTestData.DoubleTestData<>(name, array, Arrays::stream, a -> Arrays.stream(a).parallel(),
/libcore/ojluni/src/test/java/util/stream/testlib/org/openjdk/testlib/java/util/stream/
H A DTestData.java79 public static <T> OfRef<T> ofArray(String name, T[] array) { argument
80 return new AbstractTestData.RefTestData<>(name, array, Arrays::stream, a -> Arrays.stream(a).parallel(),
114 public static <T> OfInt ofArray(String name, int[] array) { argument
115 return new AbstractTestData.IntTestData<>(name, array, Arrays::stream, a -> Arrays.stream(a).parallel(),
145 public static <T> OfLong ofArray(String name, long[] array) { argument
146 return new AbstractTestData.LongTestData<>(name, array, Arrays::stream, a -> Arrays.stream(a).parallel(),
176 public static <T> OfDouble ofArray(String name, double[] array) { argument
177 return new AbstractTestData.DoubleTestData<>(name, array, Arrays::stream, a -> Arrays.stream(a).parallel(),
/libcore/jsr166-tests/src/test/java/jsr166/
H A DRecursiveActionTest.java1208 final long[] array; final int lo, hi; field in class:RecursiveActionTest.SortTask
1209 SortTask(long[] array, int lo, int hi) { argument
1210 this.array = array; this.lo = lo; this.hi = hi;
1212 SortTask(long[] array) { this(array, 0, array.length); } argument
1218 invokeAll(new SortTask(array, lo, mid),
1219 new SortTask(array, mid, hi));
1226 Arrays.sort(array, l
[all...]
/libcore/libart/src/main/java/dalvik/system/
H A DVMRuntime.java254 * Returns an array allocated in an area of the Java heap where it will never be moved.
261 * Returns an array of at least minLength, but potentially larger. The increased size comes from
262 * avoiding any padding after the array. The amount of padding varies depending on the
268 * Returns the address of array[0]. This differs from using JNI in that JNI might lie and
269 * give you the address of a copy of the array when in forcecopy mode.
271 public native long addressOf(Object array); argument
/libcore/luni/src/main/java/java/util/concurrent/
H A DCopyOnWriteArrayList.java70 * contents of an array after it has been assigned to this field.
99 * Creates a new instance containing the elements of {@code array}.
101 public CopyOnWriteArrayList(E[] array) { argument
102 this.elements = Arrays.copyOf(array, array.length, Object[].class);
425 * array and copy in the surviving elements one by one.
514 * - the elements array of the full list
516 * - the expected elements array (to detect concurrent modification)
734 * Throws if {@code index} doesn't identify an element in the array.
744 * array
[all...]
H A DPriorityBlockingQueue.java85 * The implementation uses an array-based binary heap, with public
101 * Default array capacity.
106 * The maximum size of array to allocate.
107 * Some VMs reserve some header words in an array.
109 * OutOfMemoryError: Requested array size exceeds VM limit
251 * Tries to grow array to accommodate at least one more element
256 * @param array the heap array
257 * @param oldCap the length of the array
259 private void tryGrow(Object[] array, in argument
326 siftUpComparable(int k, T x, Object[] array) argument
339 siftUpUsingComparator(int k, T x, Object[] array, Comparator<? super T> cmp) argument
362 siftDownComparable(int k, T x, Object[] array, int n) argument
383 siftDownUsingComparator(int k, T x, Object[] array, int n, Comparator<? super T> cmp) argument
833 final Object[] array; // Array of all elements field in class:PriorityBlockingQueue.Itr
837 Itr(Object[] array) argument
908 Object[] array; field in class:PriorityBlockingQueue.PBQSpliterator
912 PBQSpliterator(PriorityBlockingQueue<E> queue, Object[] array, int index, int fence) argument
[all...]
H A DScheduledThreadPoolExecutor.java827 * heap array. This eliminates the need to find a task upon
925 * Resizes the heap array. Call only when holding lock.
1263 * Snapshot iterator that works off copy of underlying q array.
1266 final RunnableScheduledFuture<?>[] array; field in class:ScheduledThreadPoolExecutor.DelayedWorkQueue.Itr
1270 Itr(RunnableScheduledFuture<?>[] array) { argument
1271 this.array = array;
1275 return cursor < array.length;
1279 if (cursor >= array.length)
1282 return array[curso
[all...]
H A DForkJoinPool.java183 * Adding tasks then takes the form of a classic array push(task)
185 * q.array[q.top++ % length] = task;
187 * (The actual code needs to null-check and size-check the array,
188 * uses masking, not mod, for indexing a power-of-two-sized array,
213 * Extracting tasks in array slots via (fully fenced) CAS provides
216 * orderings of array and index updates, so sometimes let them be
221 * the slots themselves can be read via plain array reads.) The
307 * directly. We also ensure that reads of the array reference
309 * each scan). To simplify index-based operations, the array size
313 * limit growth even if array need
788 ForkJoinTask<?>[] array; // the elements (initially unallocated) field in class:ForkJoinPool.WorkQueue
[all...]
/libcore/ojluni/src/main/java/java/nio/
H A DByteBuffer.java47 * into an array; </p></li>
51 * byte array or some other byte
74 * existing byte array into a buffer.
161 * and an array or some other buffer of the same type; and </p></li>
207 // backing array, and array offset
229 * {@link #hasArray </code>backing array<code>} is unspecified.
250 * initialized to zero. It will have a {@link #array
251 * </code>backing array<code>}, and its {@link #arrayOffset </code>array
288 wrap(byte[] array, int offset, int length) argument
311 wrap(byte[] array) argument
678 public final byte[] array() { method in class:ByteBuffer
[all...]
/libcore/ojluni/src/main/java/sun/nio/ch/
H A DDevPollArrayWrapper.java35 * Manipulates a native array of pollfd structs on Solaris:
86 // The pollfd array for results from devpoll driver
233 // Populate pollfd array with updated masks
257 // populate pollfd array with updated event
285 private void putPollFD(AllocatedNativeObject array, int index, int fd, argument
289 array.putInt(structIndex + FD_OFFSET, fd);
290 array.putShort(structIndex + EVENT_OFFSET, event);
291 array.putShort(structIndex + REVENT_OFFSET, (short)0);
/libcore/harmony-tests/src/test/java/org/apache/harmony/tests/java/nio/
H A DByteBufferTest.java56 byte array[] = buf.array();
57 assertContentEquals(buf, array, buf.arrayOffset(), buf.capacity());
59 loadTestData1(array, buf.arrayOffset(), buf.capacity());
60 assertContentEquals(buf, array, buf.arrayOffset(), buf.capacity());
62 loadTestData2(array, buf.arrayOffset(), buf.capacity());
63 assertContentEquals(buf, array, buf.arrayOffset(), buf.capacity());
66 assertContentEquals(buf, array, buf.arrayOffset(), buf.capacity());
69 assertContentEquals(buf, array, buf.arrayOffset(), buf.capacity());
73 buf.array();
2036 loadTestData1(byte array[], int offset, int length) argument
2042 loadTestData2(byte array[], int offset, int length) argument
2062 assertContentEquals(ByteBuffer buf, byte array[], int offset, int length) argument
[all...]
/libcore/ojluni/src/main/java/java/util/
H A DArrays.java53 * if the specified array reference is null, except where noted.
75 * The minimum array length below which a parallel sorting
115 * Sorts the specified array into ascending numerical order.
123 * @param a the array to be sorted
130 * Sorts the specified range of the array into ascending order. The range
141 * @param a the array to be sorted
155 * Sorts the specified array into ascending numerical order.
163 * @param a the array to be sorted
170 * Sorts the specified range of the array into ascending order. The range
181 * @param a the array t
1620 parallelPrefix(T[] array, BinaryOperator<T> op) argument
1643 parallelPrefix(T[] array, int fromIndex, int toIndex, BinaryOperator<T> op) argument
1666 parallelPrefix(long[] array, LongBinaryOperator op) argument
1688 parallelPrefix(long[] array, int fromIndex, int toIndex, LongBinaryOperator op) argument
1714 parallelPrefix(double[] array, DoubleBinaryOperator op) argument
1736 parallelPrefix(double[] array, int fromIndex, int toIndex, DoubleBinaryOperator op) argument
1759 parallelPrefix(int[] array, IntBinaryOperator op) argument
1781 parallelPrefix(int[] array, int fromIndex, int toIndex, IntBinaryOperator op) argument
3825 ArrayList(E[] array) argument
4708 setAll(T[] array, IntFunction<? extends T> generator) argument
4729 parallelSetAll(T[] array, IntFunction<? extends T> generator) argument
4747 setAll(int[] array, IntUnaryOperator generator) argument
4767 parallelSetAll(int[] array, IntUnaryOperator generator) argument
4785 setAll(long[] array, IntToLongFunction generator) argument
4805 parallelSetAll(long[] array, IntToLongFunction generator) argument
4823 setAll(double[] array, IntToDoubleFunction generator) argument
4843 parallelSetAll(double[] array, IntToDoubleFunction generator) argument
4875 spliterator(T[] array) argument
4899 spliterator(T[] array, int startInclusive, int endExclusive) argument
4915 spliterator(int[] array) argument
4938 spliterator(int[] array, int startInclusive, int endExclusive) argument
4954 spliterator(long[] array) argument
4977 spliterator(long[] array, int startInclusive, int endExclusive) argument
4994 spliterator(double[] array) argument
5017 spliterator(double[] array, int startInclusive, int endExclusive) argument
5032 stream(T[] array) argument
5051 stream(T[] array, int startInclusive, int endExclusive) argument
5063 stream(int[] array) argument
5081 stream(int[] array, int startInclusive, int endExclusive) argument
5093 stream(long[] array) argument
5111 stream(long[] array, int startInclusive, int endExclusive) argument
5123 stream(double[] array) argument
5141 stream(double[] array, int startInclusive, int endExclusive) argument
[all...]
H A DVector.java33 * The {@code Vector} class implements a growable array of
34 * objects. Like an array, it contains components that can be
88 * The array buffer into which the components of the vector are
89 * stored. The capacity of the vector is the length of this array buffer,
92 * <p>Any array elements following the last element in the Vector are null.
152 * Constructs an empty vector so that its internal data array
179 * Copies the components of this vector into the specified array.
183 * @param anArray the array into which the components get copied
184 * @throws NullPointerException if the given array is null
185 * @throws IndexOutOfBoundsException if the specified array i
1283 private Object[] array; field in class:Vector.VectorSpliterator
1289 VectorSpliterator(Vector<E> list, Object[] array, int origin, int fence, int expectedModCount) argument
[all...]
/libcore/ojluni/src/main/java/java/util/stream/
H A DStreamSpliterators.java1453 final Object[] array; field in class:StreamSpliterators.ArrayBuffer.OfRef
1456 this.array = new Object[size];
1461 array[index++] = t;
1467 T t = (T) array[i];
1486 final int[] array; field in class:StreamSpliterators.ArrayBuffer.OfInt
1489 this.array = new int[size];
1494 array[index++] = t;
1500 action.accept(array[i]);
1507 final long[] array; field in class:StreamSpliterators.ArrayBuffer.OfLong
1510 this.array
1528 final double[] array; field in class:StreamSpliterators.ArrayBuffer.OfDouble
[all...]
H A DNodes.java59 * 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) { argument
140 return new ArrayNode<>(array);
162 * @param generator the array factor
192 node(int[] array) argument
229 node(final long[] array) argument
266 node(final double[] array) argument
565 copyInto(T_ARR array, int offset) argument
639 final T[] array; field in class:Nodes.ArrayNode
650 ArrayNode(T[] array) argument
713 copyInto(T[] array, int offset) argument
792 copyInto(T[] array, int offset) argument
857 copyInto(T_ARR array, int offset) argument
1288 copyInto(T[] array, int offset) argument
1313 final int[] array; field in class:Nodes.IntArrayNode
1323 IntArrayNode(int[] array) argument
1369 final long[] array; field in class:Nodes.LongArrayNode
1379 LongArrayNode(long[] array) argument
1423 final double[] array; field in class:Nodes.DoubleArrayNode
1433 DoubleArrayNode(double[] array) argument
1680 copyInto(int[] array, int offset) argument
1740 copyInto(long[] array, int offset) argument
1800 copyInto(double[] array, int offset) argument
1899 private final P_OUT[] array; field in class:Nodes.SizedCollectorTask.OfRef
1901 OfRef(Spliterator<P_IN> spliterator, PipelineHelper<P_OUT> helper, P_OUT[] array) argument
1931 private final int[] array; field in class:Nodes.SizedCollectorTask.OfInt
1933 OfInt(Spliterator<P_IN> spliterator, PipelineHelper<Integer> helper, int[] array) argument
1963 private final long[] array; field in class:Nodes.SizedCollectorTask.OfLong
1965 OfLong(Spliterator<P_IN> spliterator, PipelineHelper<Long> helper, long[] array) argument
1995 private final double[] array; field in class:Nodes.SizedCollectorTask.OfDouble
1997 OfDouble(Spliterator<P_IN> spliterator, PipelineHelper<Double> helper, double[] array) argument
2073 private final T[] array; field in class:Nodes.ToArrayTask.OfRef
2075 OfRef(Node<T> node, T[] array, int offset) argument
2101 private final T_ARR array; field in class:Nodes.ToArrayTask.OfPrimitive
2103 OfPrimitive(T_NODE node, T_ARR array, int offset) argument
2127 OfInt(Node.OfInt node, int[] array, int offset) argument
2135 OfLong(Node.OfLong node, long[] array, int offset) argument
2143 OfDouble(Node.OfDouble node, double[] array, int offset) argument
[all...]
/libcore/luni/src/test/java/org/apache/harmony/luni/tests/java/io/
H A DObjectInputStreamTest.java862 // dynamically create serialization byte array for the next hierarchy:
1342 assertTrue(java.util.Arrays.equals(strings, testArray.array));
1348 assertTrue(java.util.Arrays.equals(integers, testArray.array));
1471 public Object[] array; field in class:TestArray
1473 public TestArray(Object[] array) { argument
1474 this.array = array;
/libcore/luni/src/test/java/tests/security/cert/
H A DX509CertSelectorTest.java462 // Used to generate following byte array
1099 // Used to generate following byte array
1651 public TestCert(byte[] array) { argument
1652 setKeyIdentifier(array);
/libcore/ojluni/src/main/java/java/awt/font/
H A DNumericShaper.java1073 * @param text an array of characters to convert
1099 * @param text an array of characters
1133 * @param text a {@code char} array
1461 * fast binary search over subrange of array.
1463 private static int search(int value, int[] array, int start, int length) argument
1470 if (value >= array[index + extra]) {
1477 if (value >= array[index + probe]) {
/libcore/ojluni/src/main/java/java/io/
H A DObjectOutputStream.java581 * type of the field or array element abort the serialization by raising an
695 * Writes an array of bytes. This method will block until the bytes are
706 * Writes a sub array of bytes.
1354 * Writes given array object to stream.
1356 private void writeArray(Object array, argument
1363 handles.assign(unshared ? null : array);
1368 int[] ia = (int[]) array;
1372 byte[] ba = (byte[]) array;
1376 long[] ja = (long[]) array;
1380 float[] fa = (float[]) array;
[all...]
H A DObjectInputStream.java436 * and the invocation of that method returns an array, then readUnshared
437 * returns a shallow clone of that array; this guarantees that the returned
438 * array object is unique and cannot be obtained a second time from an
589 * <code>Class</code> object. Once returned, if the class is not an array
737 * field or array element abort the serialization by raising an exception
846 * Reads into an array of bytes. This method will block until some input
1656 * Reads in and returns array object, or null if array class is
1657 * unresolvable. Sets passHandle to array's assigned handle.
1667 Object array
3517 cloneArray(Object array) argument
[all...]
/libcore/harmony-tests/src/test/java/org/apache/harmony/tests/javax/security/auth/x500/
H A DX500PrincipalTest.java263 private byte[] getByteArray(byte[] array) { argument
266 ByteArrayInputStream is = new ByteArrayInputStream(array);
458 * Inits X500Principal with byte array
472 * Inits X500Principal with byte array
487 * Inits X500Principal with byte array
512 * Inits X500Principal with byte array, where Oid does fall into any keyword, but not given as a keyword
527 * Inits X500Principal with byte array, where Oid does fall into any keyword, but not given as a keyword
542 * Inits X500Principal with byte array, where Oid does fall into any keyword, but not given as a keyword
557 * Inits X500Principal with byte array, where Oid does not fall into any keyword
573 * Inits X500Principal with byte array, wher
[all...]
/libcore/luni/src/main/native/
H A Dorg_apache_harmony_xml_ExpatParser.cpp64 StringStack() : array(new jstring[DEFAULT_CAPACITY]), capacity(DEFAULT_CAPACITY), size(0) {
68 delete[] array;
79 memcpy(newArray, array, capacity * sizeof(jstring));
81 delete[] array;
82 array = newArray;
86 array[size++] = s;
90 return (size == 0) ? NULL : array[--size];
96 jstring* array; member in class:StringStack
1096 * @param attributePointer to the attribute array
1109 * @param attributePointer to the attribute array
[all...]
/libcore/harmony-tests/src/test/java/org/apache/harmony/tests/java/util/
H A DArraysTest.java88 "Array and List converted from array do not contain identical elements",
103 "Array and List converted from array do not contain identical elements",
123 assertEquals("Binary search succeeded for value not present in array 1",
126 "Binary search succeeded for value not present in array 2",
145 assertEquals("Binary search succeeded for value not present in array 1",
148 "Binary search succeeded for value not present in array 2",
161 assertEquals("Binary search succeeded for value not present in array 1",
164 "Binary search succeeded for value not present in array 2",
195 assertEquals("Binary search succeeded for value not present in array 1",
198 "Binary search succeeded for value not present in array
1894 sort(Object array) argument
1915 checkSorted(Object array) argument
1996 checkSum(Object array) argument
4268 final int[] array; field in class:ArraysTest.PrimitiveIntArrayList
4286 final long[] array; field in class:ArraysTest.PrimitiveLongArrayList
4304 final double[] array; field in class:ArraysTest.PrimitiveDoubleArrayList
[all...]

Completed in 854 milliseconds

123