Home
last modified time | relevance | path

Searched refs:intArray (Results 1 – 8 of 8) sorted by relevance

/libcore/luni/src/test/java/libcore/java/lang/reflect/
DOldAndroidArrayTest.java28 Object intArray = Array.newInstance(Integer.TYPE, 2); in testSingleInt() local
30 int[] array = (int[]) intArray; in testSingleInt()
32 Array.setInt(intArray, 1, 6); in testSingleInt()
34 assertEquals(5, Array.getInt(intArray, 0)); in testSingleInt()
45 assertEquals(Array.getLength(intArray), array.length); in testSingleInt()
48 int[][] wrongArray = (int[][]) intArray; in testSingleInt()
54 intArray = Array.newInstance(Integer.TYPE, 0); in testSingleInt()
55 assertEquals(0, Array.getLength(intArray)); in testSingleInt()
/libcore/luni/src/main/java/org/apache/harmony/security/provider/crypto/
DSHA1Impl.java168 static void updateHash(int[] intArray, byte[] byteInput, int fromByte, int toByte) { in updateHash() argument
173 int index = intArray[BYTES_OFFSET]; in updateHash()
181 intArray[BYTES_OFFSET] = ( index + toByte - fromByte + 1 ) & 077 ; in updateHash()
191 intArray[wordIndex] |= ( byteInput[i] & 0xFF ) << ((3 - byteIndex)<<3) ; in updateHash()
198 computeHash(intArray); in updateHash()
212 intArray[wordIndex] = ( ((int) byteInput[i ] & 0xFF) <<24 ) | in updateHash()
222 computeHash(intArray); // buffer is full, computing hash in updateHash()
240 intArray[wordIndex] = w; in updateHash()
/libcore/benchmarks/src/benchmarks/regression/
DSerializationBenchmark.java36 int[] intArray = new int[256]; in timeReadIntArray() local
37 readSingleObject(reps, intArray); in timeReadIntArray()
41 int[] intArray = new int[256]; in timeWriteIntArray() local
42 writeSingleObject(reps, intArray); in timeWriteIntArray()
/libcore/harmony-tests/src/test/java/org/apache/harmony/tests/java/util/
DArraysTest.java60 int[] intArray; field in ArraysTest
113 -1, Arrays.binarySearch(intArray, (byte) -1)); in test_binarySearch$BB()
116 Arrays.binarySearch(intArray, (byte) arraySize) == -(arraySize + 1)); in test_binarySearch$BB()
215 Arrays.binarySearch(intArray, counter) == counter); in test_binarySearch$II()
217 -1, Arrays.binarySearch(intArray, -1)); in test_binarySearch$II()
219 Arrays.binarySearch(intArray, arraySize) == -(arraySize + 1)); in test_binarySearch$II()
221 intArray[counter] -= 50; in test_binarySearch$II()
225 Arrays.binarySearch(intArray, counter - 50) == counter); in test_binarySearch$II()
316 -1, Arrays.binarySearch(intArray, (short) -1)); in test_binarySearch$SS()
319 Arrays.binarySearch(intArray, (short) arraySize) == -(arraySize + 1)); in test_binarySearch$SS()
[all …]
/libcore/harmony-tests/src/test/java/org/apache/harmony/tests/java/net/
DInet6AddressTest.java836 int intArray[] = new int[times]; in byteArrayToHexString() local
838 intArray[i] = bytesToInt(bytes, i * 4); in byteArrayToHexString()
841 return intArrayToHexString(intArray, leadingZeros); in byteArrayToHexString()
/libcore/luni/src/main/java/java/io/
DObjectOutputStream.java1128 int[] intArray = (int[]) array; in writeNewArray() local
1129 output.writeInt(intArray.length); in writeNewArray()
1130 for (int i = 0; i < intArray.length; i++) { in writeNewArray()
1131 output.writeInt(intArray[i]); in writeNewArray()
DObjectInputStream.java1440 int[] intArray = (int[]) result; in readNewArray() local
1442 intArray[i] = input.readInt(); in readNewArray()
/libcore/luni/src/test/java/libcore/java/nio/
DOldAndroidNIOTest.java59 int[] intArray = new int[8]; in testNIO_int_array() local
60 IntBuffer ib = IntBuffer.wrap(intArray); in testNIO_int_array()