Package java.math

Examples of java.math.BigInteger.divide()

323
324
325
326
327
328
329
330
331
332
333
        boolean high;
        int U;
        while (true) {
            k--;
            BigInteger R10 = R.multiply(TEN);
            U = R10.divide(S).intValue();
            R = R10.mod(S);
            Mminus = Mminus.multiply(TEN);
            Mplus = Mplus.multiply(TEN);
            BigInteger R2 = R.shiftLeft(1);
            low = R2.compareTo(Mminus) < 0;
View Full Code Here
412
413
414
415
416
417
418
419
420
421
422
        boolean high;
        int U;
        while (true) {
            k--;
            BigInteger R10 = R.multiply(TEN);
            U = R10.divide(S).intValue();
            R = R10.mod(S);
            Mminus = Mminus.multiply(TEN);
            Mplus = Mplus.multiply(TEN);
            BigInteger R2 = R.shiftLeft(1);
            low = R2.compareTo(Mminus) < 0;
View Full Code Here
378
379
380
381
382
383
384
385
386
387
388
        if (scale >= 0) {
            return this;
        } else {
            BigInteger factor = BigInteger.valueOf(10).pow(-scale);
            BigInteger[] pair = value.divideAndRemainder(factor);
            int up = pair[1].compareTo(factor.divide(BigInteger.valueOf(2)));
            if (up > 0) {
                // remainder is > .5
                pair[0] = pair[0].add(BigInteger.valueOf(1));
            } else if (up == 0) {
                // remainder == .5
View Full Code Here
320
321
322
323
324
325
326
327
328
329
330
        boolean high;
        int U;
        while (true) {
            k--;
            final BigInteger R10 = R.multiply(TEN);
            U = R10.divide(S).intValue();
            R = R10.mod(S);
            Mminus = Mminus.multiply(TEN);
            Mplus = Mplus.multiply(TEN);
            final BigInteger R2 = R.shiftLeft(1);
            low = R2.compareTo(Mminus) < 0;
View Full Code Here
409
410
411
412
413
414
415
416
417
418
419
        boolean high;
        int U;
        while (true) {
            k--;
            final BigInteger R10 = R.multiply(TEN);
            U = R10.divide(S).intValue();
            R = R10.mod(S);
            Mminus = Mminus.multiply(TEN);
            Mplus = Mplus.multiply(TEN);
            final BigInteger R2 = R.shiftLeft(1);
            low = R2.compareTo(Mminus) < 0;
View Full Code Here
477
478
479
480
481
482
483
484
485
486
487
                y >>= 1;
            }
           
            BigInteger bigX = BigInteger.valueOf(x);
            BigInteger bigXZ = bigX.multiply(bigX);
            if (bigXZ.divide(bigX).longValue() != z) {
                IRubyObject v = RubyBignum.newBignum(runtime, RubyBignum.fix2big(RubyFixnum.newFixnum(runtime, x))).op_pow(context, RubyFixnum.newFixnum(runtime, y));
                if (z != 1) v = RubyBignum.newBignum(runtime, RubyBignum.fix2big(RubyFixnum.newFixnum(runtime, neg ? -z : z))).op_mul19(context, v);
                return v;
            }
            z = bigXZ.longValue();
View Full Code Here
67
68
69
70
71
72
73
74
75
76
77
      && (bi.compareTo(BigIntegerDecimal.MINLONG_MINUS_ONE) > 0))
      rangeOk = true;
     
    for (int i = 0; i < sqlScale; i++)
    {
      bi = bi.divide(BigIntegerDecimal.TEN);
      if (rangeOk)
        continue;
     
      if ((bi.compareTo(BigIntegerDecimal.MAXLONG_PLUS_ONE) < 0)
          && (bi.compareTo(BigIntegerDecimal.MINLONG_MINUS_ONE) > 0))
View Full Code Here
148
149
150
151
152
153
154
155
156
157
158
    for (int i = 0; i < n; i++)
      if (pow[i] > 0)
        det = det.multiply(b[i][i].pow(pow[i]));
    for (int i = 0; i < n; i++)
      if (pow[i] < 0)
        det = det.divide(b[i][i].pow(-pow[i]));
    if (sign < 0)
      det = det.negate();
    return det;
  }
View Full Code Here
1201
1202
1203
1204
1205
1206
1207
1208
1209
1210
1211
    // this algorithm gives us the alphanumeric number in reverse order
    while (value.compareTo(BigInteger.ZERO) > 0)
    {
      int remainder = value.mod(sixtyTwo).intValue();
      sb.append(CONSTANT.ALPHANUMERIC_DIGITS[remainder]);
      value = value.divide(sixtyTwo);
    }

    // reverse result
    return StringUtils.reverse(sb.toString());
  }
View Full Code Here
1201
1202
1203
1204
1205
1206
1207
1208
1209
1210
1211
    // this algorithm gives us the alphanumeric number in reverse order
    while (value.compareTo(BigInteger.ZERO) > 0)
    {
      int remainder = value.mod(sixtyTwo).intValue();
      sb.append(CONSTANT.ALPHANUMERIC_DIGITS[remainder]);
      value = value.divide(sixtyTwo);
    }

    // reverse result
    return StringUtils.reverse(sb.toString());
  }
View Full Code Here
TOP
Copyright © 2018 www.massapi.com. All rights reserved.
All source code are property of their respective owners. Java is a trademark of Sun Microsystems, Inc and owned by ORACLE Inc. Contact coftware#gmail.com.