Package java.math

Examples of java.math.BigInteger.divide()

125
126
127
128
129
130
131
132
133
134
135
    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
133
134
135
136
137
138
139
140
141
142
143
        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
140
141
142
143
144
145
146
147
148
149
150
        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
133
134
135
136
137
138
139
140
141
142
143
        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())).intValue();
      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
140
141
142
143
144
145
146
147
148
149
150
        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)).intValue();
      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
133
134
135
136
137
138
139
140
141
142
143
        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())).longValue();
      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
140
141
142
143
144
145
146
147
148
149
150
        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
133
134
135
136
137
138
139
140
141
142
143
        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
139
140
141
142
143
144
145
146
147
148
149
      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
133
134
135
136
137
138
139
140
141
142
143
        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())).shortValue();
      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
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.