Examples of java.math.BigInteger.divide()

java.math.BigInteger.divide()
Returns a BigInteger whose value is {@code (this / val)}. @param val value by which this BigInteger is to be divided. @return {@code this / val} @throws ArithmeticException {@code val==0}

        if (values.size() % 2 == 1)
          return values.get(values.size() / 2);
        BigInteger bi = BigInteger.valueOf(values.get(
                values.size() / 2 - 1));
        bi = bi.add(BigInteger.valueOf(values.get(values.size() / 2)));
        return bi.divide(BigInteger.valueOf(2)).longValue();
      case MODE:
        Hashtable<Integer, Integer> map =
            new Hashtable<Integer, Integer>();
        for (int i = 0; i < values.size(); ++i) {
          int prev = 0;

View Full Code Here

        if (values.size() == 1)
          return values.get(0);
        BigInteger total = BigInteger.valueOf(0);
        for (int i = 0; i < values.size(); ++i)
          total = total.add(BigInteger.valueOf(values.get(i)));
        return total.divide(BigInteger.valueOf(values.size())).byteValue();
      case MEDIAN:
        if (values.size() % 2 == 1)
          return values.get(values.size() / 2);
        BigInteger bi = BigInteger.valueOf(values.get(
                values.size() / 2 - 1));

View Full Code Here

        if (values.size() % 2 == 1)
          return values.get(values.size() / 2);
        BigInteger bi = BigInteger.valueOf(values.get(
                values.size() / 2 - 1));
        bi = bi.add(BigInteger.valueOf(values.get(values.size() / 2)));
        return bi.divide(BigInteger.valueOf(2)).byteValue();
      case MODE:
        Hashtable<Integer, Integer> map =
            new Hashtable<Integer, Integer>();
        for (int i = 0; i < values.size(); ++i) {
          int prev = 0;

View Full Code Here

        if (values.size() == 1)
          return values.get(0);
        BigInteger total = BigInteger.valueOf(0);
        for (int i = 0; i < values.size(); ++i)
          total = total.add(values.get(i));
        return total.divide(BigInteger.valueOf(values.size()));
      case MEDIAN:
        if (values.size() % 2 == 1)
          return values.get(values.size() / 2);
        BigInteger bi = values.get(values.size() / 2 - 1);
        bi = bi.add(values.get(values.size() / 2));

View Full Code Here

      case MEDIAN:
        if (values.size() % 2 == 1)
          return values.get(values.size() / 2);
        BigInteger bi = values.get(values.size() / 2 - 1);
        bi = bi.add(values.get(values.size() / 2));
        return bi.divide(BigInteger.valueOf(2));
      case MODE:
        Hashtable<Integer, Integer> map =
            new Hashtable<Integer, Integer>();
        for (int i = 0; i < values.size(); ++i) {
          int prev = 0;

View Full Code Here

      && (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

        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

        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

        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


    public SimpleBigDecimal divide(SimpleBigDecimal b)
    {
        checkScale(b);
        BigInteger dividend = bigInt.shiftLeft(scale);
        return new SimpleBigDecimal(dividend.divide(b.bigInt), scale);
    }


    public SimpleBigDecimal divide(BigInteger b)
    {
        return new SimpleBigDecimal(bigInt.divide(b), scale);

View Full Code Here

0 1 2 3 4 5 6 7 8 9

TOP

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.