Home
last modified time | relevance | path

Searched refs:arrayLength (Results 1 – 9 of 9) sorted by relevance

/libcore/benchmarks/src/benchmarks/
DSystemArrayCopyBenchmark.java24 int arrayLength; field in SystemArrayCopyBenchmark
29 final int len = arrayLength; in timeSystemCharArrayCopy()
38 final int len = arrayLength; in timeSystemByteArrayCopy()
47 final int len = arrayLength; in timeSystemShortArrayCopy()
56 final int len = arrayLength; in timeSystemIntArrayCopy()
65 final int len = arrayLength; in timeSystemLongArrayCopy()
74 final int len = arrayLength; in timeSystemFloatArrayCopy()
83 final int len = arrayLength; in timeSystemDoubleArrayCopy()
92 final int len = arrayLength; in timeSystemBooleanArrayCopy()
DDeepArrayOpsBenchmark.java25 @Param({"1", "4", "16", "256", "2048"}) int arrayLength; field in DeepArrayOpsBenchmark
34 array = new Object[arrayLength * 13]; in setUp()
35 array2 = new Object[arrayLength * 13]; in setUp()
36 for (int i = 0; i < arrayLength; i += 13) { in setUp()
/libcore/ojluni/src/main/java/java/util/stream/
DSpinedBuffer.java479 protected abstract int arrayLength(T_ARR array); in arrayLength() method in SpinedBuffer.OfPrimitive
487 ? arrayLength(curChunk) in capacity()
488 : priorElementCount[spineIndex] + arrayLength(spine[spineIndex]); in capacity()
511 priorElementCount[i] = priorElementCount[i-1] + arrayLength(spine[i - 1]); in ensureCapacity()
533 if (index < priorElementCount[j] + arrayLength(spine[j])) in chunkFor()
541 if (finalOffset > arrayLength(array) || finalOffset < offset) { in copyInto()
550 System.arraycopy(spine[i], 0, array, offset, arrayLength(spine[i])); in copyInto()
551 offset += arrayLength(spine[i]); in copyInto()
568 if (elementIndex == arrayLength(curChunk)) { in preAccept()
592 arrayForEach(spine[j], 0, arrayLength(spine[j]), consumer); in forEach()
[all …]
DNodes.java1836 int arrayLength) {
1842 this.length = arrayLength;
1846 long offset, long length, int arrayLength) {
1855 if (offset < 0 || length < 0 || (offset + length - 1 >= arrayLength)) {
1858 offset, offset, length, arrayLength));
/libcore/ojluni/src/lambda/java/java/lang/invoke/
DMethodHandle.java42 public MethodHandle asCollector(Class<?> arrayType, int arrayLength) { return null; } in asCollector() argument
/libcore/harmony-tests/src/test/java/org/apache/harmony/tests/java/lang/
DThreadTest.java306 int arrayLength = 10; in test_enumerate$Ljava_lang_Thread() local
307 Thread[] tarray = new Thread[arrayLength]; in test_enumerate$Ljava_lang_Thread()
/libcore/ojluni/src/main/java/java/util/
DSpliterators.java385 private static void checkFromToBounds(int arrayLength, int origin, int fence) { in checkFromToBounds() argument
393 if (fence > arrayLength) { in checkFromToBounds()
DArrays.java4855 public static void checkOffsetAndCount(int arrayLength, int offset, int count) { in checkOffsetAndCount() argument
4856 if ((offset | count) < 0 || offset > arrayLength || arrayLength - offset < count) { in checkOffsetAndCount()
4857 throw new ArrayIndexOutOfBoundsException(arrayLength, offset, in checkOffsetAndCount()
/libcore/luni/src/main/native/
Dlibcore_io_Posix.cpp1373 size_t arrayLength = env->GetArrayLength(javaStructs); in Posix_poll() local
1374 std::unique_ptr<struct pollfd[]> fds(new struct pollfd[arrayLength]); in Posix_poll()
1375 memset(fds.get(), 0, sizeof(struct pollfd) * arrayLength); in Posix_poll()
1377 for (size_t i = 0; i < arrayLength; ++i) { in Posix_poll()