Lines Matching refs:source
114 static void shiftLeftOneBit(int[] result, int[] source, int srcLen) {
117 int val = source[i];
126 static BigInteger shiftLeftOneBit(BigInteger source) {
127 source.prepareJavaRepresentation();
128 int srcLen = source.numberLength;
131 shiftLeftOneBit(resDigits, source.digits, srcLen);
132 return new BigInteger(source.sign, resLen, resDigits);
136 static BigInteger shiftRight(BigInteger source, int count) {
137 source.prepareJavaRepresentation();
140 if (intCount >= source.numberLength) {
141 return ((source.sign < 0) ? BigInteger.MINUS_ONE : BigInteger.ZERO);
144 int resLength = source.numberLength - intCount;
147 shiftRight(resDigits, resLength, source.digits, intCount, count);
148 if (source.sign < 0) {
151 for (i = 0; (i < intCount) && (source.digits[i] == 0); i++) {
156 || ((count > 0) && ((source.digits[i] << (32 - count)) != 0))) {
166 return new BigInteger(source.sign, resLength, resDigits);
177 * @param source
178 * the source array
185 static boolean shiftRight(int[] result, int resultLen, int[] source, int intCount, int count) {
189 allZero &= source[i] == 0;
191 System.arraycopy(source, intCount, result, 0, resultLen);
196 allZero &= ( source[i] << leftShiftCount ) == 0;
198 result[i] = ( source[i + intCount] >>> count )
199 | ( source[i + intCount + 1] << leftShiftCount );
201 result[i] = ( source[i + intCount] >>> count );