Package java.math

Examples of java.math.BigInteger.shiftLeft()

339
340
341
342
343
344
345
346
347
348
349
        while(!((r0.equals(ECConstants.ZERO)) && (r1.equals(ECConstants.ZERO))))
        {
            // If r0 is odd
            if (r0.testBit(0))
            {
                u[i] = (byte) ECConstants.TWO.subtract((r0.subtract(r1.shiftLeft(1))).mod(ECConstants.FOUR)).intValue();

                // r0 = r0 - u[i]
                if (u[i] == 1)
                {
                    r0 = r0.clearBit(0);
View Full Code Here
30
31
32
33
34
35
36
37
38
39
40
  {
    harness.checkPoint ("shift");
    BigInteger x =
      new BigInteger ("-50123044517898350982301255831878893568", 10);
    harness.check (x.shiftRight(64).toString(), "-2717175687894652269");
    harness.check (x.shiftLeft(-64).toString(), "-2717175687894652269");
    harness.check (x.shiftRight(1).toString(),
      "-25061522258949175491150627915939446784");
    harness.check (x.shiftLeft(1).toString(),
      "-100246089035796701964602511663757787136");
View Full Code Here
33
34
35
36
37
38
39
40
41
42
43
      new BigInteger ("-50123044517898350982301255831878893568", 10);
    harness.check (x.shiftRight(64).toString(), "-2717175687894652269");
    harness.check (x.shiftLeft(-64).toString(), "-2717175687894652269");
    harness.check (x.shiftRight(1).toString(),
      "-25061522258949175491150627915939446784");
    harness.check (x.shiftLeft(1).toString(),
      "-100246089035796701964602511663757787136");

    harness.check (x.shiftRight(0).toString(), x.toString());
    harness.check (x.shiftLeft(0).toString(), x.toString());
View Full Code Here
37
38
39
40
41
42
43
44
45
46
47
      "-25061522258949175491150627915939446784");
    harness.check (x.shiftLeft(1).toString(),
      "-100246089035796701964602511663757787136");

    harness.check (x.shiftRight(0).toString(), x.toString());
    harness.check (x.shiftLeft(0).toString(), x.toString());

    x = new BigInteger ("50123044517898350982301255831878893568", 10);
    harness.check (x.shiftRight(64).toString(), "2717175687894652268");
    harness.check (x.shiftLeft(-64).toString(), "2717175687894652268");
    harness.check (x.shiftRight(1).toString(),
View Full Code Here
41
42
43
44
45
46
47
48
49
50
51
    harness.check (x.shiftRight(0).toString(), x.toString());
    harness.check (x.shiftLeft(0).toString(), x.toString());

    x = new BigInteger ("50123044517898350982301255831878893568", 10);
    harness.check (x.shiftRight(64).toString(), "2717175687894652268");
    harness.check (x.shiftLeft(-64).toString(), "2717175687894652268");
    harness.check (x.shiftRight(1).toString(),
      "25061522258949175491150627915939446784");
    harness.check (x.shiftLeft(1).toString(),
      "100246089035796701964602511663757787136");
  }
View Full Code Here
44
45
46
47
48
49
50
51
52
    x = new BigInteger ("50123044517898350982301255831878893568", 10);
    harness.check (x.shiftRight(64).toString(), "2717175687894652268");
    harness.check (x.shiftLeft(-64).toString(), "2717175687894652268");
    harness.check (x.shiftRight(1).toString(),
      "25061522258949175491150627915939446784");
    harness.check (x.shiftLeft(1).toString(),
      "100246089035796701964602511663757787136");
  }
}
View Full Code Here
227
228
229
230
231
232
233
234
235
236
237
  }

  public BigInteger getBigInteger() {
    BigInteger result = BigInteger.ZERO;
    for (int i = this.size - 1; i >= 0; i--) {
      result = result.shiftLeft(1);
      if (this.get(i)) {
        result = result.add(BigInteger.ONE);
      }
    }
    return result;
View Full Code Here
130
131
132
133
134
135
136
137
138
139
140
                        /* test whether a^(d*2^r) = -1 (mod n), 0<=r<s
                        */
                        for(int r=0; r < s ; r++)
                        {
                                if ( a.modPow(d.shiftLeft(r),n).compareTo(q) == 0 )
                                        return true ;
                        }
                        return false ;
                }
        }
View Full Code Here
279
280
281
282
283
284
285
286
287
288
289
                 */
                //System.out.print("A("+(2 * n + 1)+"):");
                BigDecimal c = zeta(2 * n + 1, mcloc,bern_cache,fact_cache).subtract(BigDecimal.ONE,mcloc);
                //System.out.print("B");
                BigInteger fourn = new BigInteger("" + (2 * n + 1));
                fourn = fourn.shiftLeft(2 * n);
                c = c.divide(new BigDecimal(fourn),mcloc);
                resul = resul.subtract(c,mcloc);
                //if (c.doubleValue() < 0.1 * eps)                      // removed by l.bruninx, 2012-03-26
                //    break;                                            // removed by l.bruninx, 2012-03-26
               
View Full Code Here
1470
1471
1472
1473
1474
1475
1476
1477
1478
1479
1480
     * @throws Exception
     */
    public Node external_lshift(Node startAt) throws Exception {
        startAt.isGoodArgsCnt(2);
        BigInteger r = number.get();
        r = r.shiftLeft((int) startAt.getSubNode(1, Node.TYPE_NUMBER).getNumber());
        return Node.createExternal(new External_Integer(r));
    }

    /**
     * surcharge de l'opérateur lshift!
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.