Lines Matching refs:intCount
104 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 * 32 + count.
179 * @param intCount
185 static boolean shiftRight(int[] result, int resultLen, int[] source, int intCount, int count) {
188 for (i = 0; i < intCount; i++)
191 System.arraycopy(source, intCount, result, 0, resultLen);
198 result[i] = ( source[i + intCount] >>> count )
199 | ( source[i + intCount + 1] << leftShiftCount );
201 result[i] = ( source[i + intCount] >>> count );
216 int intCount = n >> 5;
218 int resLength = Math.max(intCount + 1, val.numberLength) + 1;
226 if (intCount >= val.numberLength) {
227 resDigits[intCount] = bitNumber;
229 //val.sign<0 y intCount < val.numberLength
231 if (intCount > firstNonZeroDigit) {
232 resDigits[intCount] ^= bitNumber;
233 } else if (intCount < firstNonZeroDigit) {
234 resDigits[intCount] = -bitNumber;
235 for (i=intCount + 1; i < firstNonZeroDigit; i++) {
240 i = intCount;
241 resDigits[i] = -((-resDigits[intCount]) ^ bitNumber);
251 resDigits[intCount] ^= bitNumber;