Lines Matching defs:intLen
60 * at an offset and offset + intLen may be less than value.length.
62 int intLen;
86 intLen = 0;
95 intLen = 1;
105 intLen = val.length;
113 intLen = b.mag.length;
114 value = Arrays.copyOf(b.mag, intLen);
122 intLen = val.intLen;
123 value = Arrays.copyOfRange(val.value, val.offset, val.offset + intLen);
131 if (offset > 0 || value.length != intLen)
132 return Arrays.copyOfRange(value, offset, offset + intLen);
141 assert (intLen <= 2) : "this MutableBigInteger exceeds the range of long";
142 if (intLen == 0)
145 return (intLen == 2) ? d << 32 | (value[offset + 1] & LONG_MASK) : d;
152 if (intLen == 0 || sign == 0)
162 if (intLen == 0 || sign == 0)
181 offset = intLen = 0;
190 offset = intLen = 0;
199 int blen = b.intLen;
200 if (intLen < blen)
202 if (intLen > blen)
208 for (int i = offset, j = b.offset; i < intLen + offset; i++, j++) {
226 int blen = b.intLen;
227 int len = intLen;
264 if (intLen == 0)
267 for (j=intLen-1; (j>0) && (value[j+offset]==0); j--)
272 return ((intLen-1-j)<<5) + Integer.numberOfTrailingZeros(b);
296 * magnitude is zero, then intLen is zero.
299 if (intLen == 0) {
308 int indexBound = index+intLen;
314 intLen -= numZeros;
315 offset = (intLen==0 ? 0 : offset+numZeros);
326 intLen = len;
332 * zeros, of a length that is equal to this MutableBigInteger's intLen.
335 int[] result = new int[intLen];
336 for(int i=0; i<intLen; i++)
352 * The intLen is set to the specified length.
356 intLen = length;
362 * array. The intLen is set to the length of the new array.
365 int len = src.intLen;
369 intLen = len;
375 * array. The intLen is set to the length of the specified array.
382 intLen = len;
390 return (intLen == 1) && (value[offset] == 1);
397 return (intLen == 0);
404 return (intLen == 0) || ((value[offset + intLen - 1] & 1) == 0);
411 return isZero() ? false : ((value[offset + intLen - 1] & 1) == 1);
417 * after the offset, and intLen + offset <= value.length.
420 if (intLen + offset > value.length)
422 if (intLen ==0)
440 if (intLen == 0)
444 this.intLen -= nInts;
450 this.intLen--;
466 if (intLen == 0)
478 int newLen = intLen + nInts +1;
484 for (int i=0; i<intLen; i++)
489 for(int i=0; i<newLen - intLen; i++)
490 value[offset+intLen+i] = 0;
493 for (int i=0; i<intLen; i++)
495 for (int i=intLen; i<newLen; i++)
499 intLen = newLen;
549 * Assumes that intLen > 0, n > 0 for speed
554 for (int i=offset+intLen-1, c=val[i]; i>offset; i--) {
565 * Assumes that intLen > 0, n > 0 for speed
570 for (int i=offset, c=val[i], m=i+intLen-1; i<m; i++) {
575 val[offset+intLen-1] <<= n;
584 int x = intLen;
585 int y = addend.intLen;
586 int resultLen = (intLen > addend.intLen ? intLen : addend.intLen);
633 intLen = resultLen;
658 int resultLen = a.intLen;
663 int x = a.intLen;
664 int y = b.intLen;
683 intLen = resultLen;
706 int x = a.intLen;
707 int y = b.intLen;
732 int xLen = intLen;
733 int yLen = y.intLen;
740 z.intLen = newLen;
786 int[] zval = (z.value.length<intLen+1 ? new int[intLen + 1]
789 for (int i = intLen-1; i >= 0; i--) {
797 z.intLen = intLen;
800 z.intLen = intLen + 1;
818 if (intLen == 1) {
823 quotient.intLen = (q == 0) ? 0 : 1;
828 if (quotient.value.length < intLen)
829 quotient.value = new int[intLen];
831 quotient.intLen = intLen;
846 int xlen = intLen;
850 (value[offset + intLen - xlen] & LONG_MASK);
857 quotient.value[intLen - xlen] = qWord[0];
882 if (b.intLen == 0)
886 if (intLen == 0) {
887 quotient.intLen = quotient.offset;
894 quotient.intLen = quotient.offset = 0;
899 quotient.value[0] = quotient.intLen = 1;
906 if (b.intLen == 1) {
914 int[] div = Arrays.copyOfRange(b.value, b.offset, b.offset + b.intLen);
930 if (intLen == 0) {
931 quotient.intLen = quotient.offset = 0;
957 MutableBigInteger rem = new MutableBigInteger(new int[intLen + 1]);
958 System.arraycopy(value, offset, rem.value, 1, intLen);
959 rem.intLen = intLen;
962 int nlen = rem.intLen;
971 quotient.intLen = limit;
984 if (rem.intLen == nlen) {
987 rem.intLen++;
1116 while (b.intLen != 0) {
1117 if (Math.abs(a.intLen - b.intLen) < 2)
1161 if (u.intLen < 2 && v.intLen < 2) {
1166 r.intLen = 1;
1270 int t = inverseMod32(value[offset+intLen-1]);
1277 long pLong = (value[offset+intLen-1] & LONG_MASK);
1278 if (intLen > 1)
1279 pLong |= ((long)value[offset+intLen-2] << 32);
1287 result.intLen = 2;
1353 if (((f.value[f.offset + f.intLen - 1] ^
1354 g.value[g.offset + g.intLen - 1]) & 3) == 0) {
1384 int r = -inverseMod32(p.value[p.offset+p.intLen-1]);
1388 int v = r * c.value[c.offset + c.intLen-1];
1393 c.intLen--;
1398 int v = r * c.value[c.offset + c.intLen-1];
1439 if (r.intLen == 0)
1445 if (q.intLen == 1)
1459 if (r.intLen == 0)
1465 if (q.intLen == 1)