Searched refs:intCount (Results 1 - 6 of 6) sorted by relevance

/libcore/luni/src/main/java/java/math/
H A DBitLevel.java104 int intCount = numberOfBits >> 5;
108 for (i = 0; (i < intCount) && (digits[i] == 0); i++) {
111 return ((i != intCount) || (digits[i] << (32 - bitCount) != 0));
138 int intCount = count >> 5; // count of integers
140 if (intCount >= source.numberLength) {
144 int resLength = source.numberLength - intCount;
147 shiftRight(resDigits, resLength, source.digits, intCount, count);
151 for (i = 0; (i < intCount) && (source.digits[i] == 0); i++) {
155 if ((i < intCount)
171 * intCount * 3
185 shiftRight(int[] result, int resultLen, int[] source, int intCount, int count) argument
[all...]
H A DBigInteger.java551 int intCount = n >> 5;
552 if (intCount >= numberLength) {
555 int digit = digits[intCount];
559 if (intCount < firstNonZeroDigit) {
561 } else if (firstNonZeroDigit == intCount) {
/libcore/luni/src/main/java/libcore/io/
H A DBufferIterator.java53 * Copies {@code intCount} 32-bit ints from the current position into {@code dst}, starting at
54 * {@code dstOffset}, and advances the current position {@code 4 * intCount} bytes.
56 public abstract void readIntArray(int[] dst, int dstOffset, int intCount); argument
H A DNioBufferIterator.java65 public void readIntArray(int[] dst, int dstOffset, int intCount) { argument
66 Memory.peekIntArray(address + position, dst, dstOffset, intCount, swap);
67 position += SizeOf.INT * intCount;
H A DMemory.java186 public static native void peekIntArray(long address, int[] dst, int dstOffset, int intCount, boolean swap); argument
/libcore/luni/src/test/java/libcore/util/
H A DZoneInfoTest.java517 public void readIntArray(int[] dst, int dstOffset, int intCount) { argument
518 buffer.asIntBuffer().get(dst, dstOffset, intCount);
521 skip(4 * intCount);

Completed in 92 milliseconds