Examples of bitCount()

Examples of java.math.BigInteger.bitCount()

40
41
42
43
44
45
46
47
48
49
50
    /**
     * bitCount() of a negative number.
     */
    public void testBitCountNeg() {
        BigInteger aNumber = new BigInteger("-12378634756382937873487638746283767238657872368748726875");
        assertEquals(87, aNumber.bitCount());
    }

    /**
     * bitCount() of a negative number.
     */
 
View Full Code Here

Examples of java.math.BigInteger.bitCount()

48
49
50
51
52
53
54
55
56
57
58
    /**
     * bitCount() of a negative number.
     */
    public void testBitCountPos() {
        BigInteger aNumber = new BigInteger("12378634756343564757582937873487638746283767238657872368748726875");
        assertEquals(107, aNumber.bitCount());
    }

    /**
     * bitLength() of zero.
     */
 
View Full Code Here

Examples of java.math.BigInteger.bitCount()

35
36
37
38
39
40
41
42
43
44
45
    bb.put((byte)0xff).put((byte)0xff).put((byte)0xff).put((byte)0xff);
    bb.position(0);
    bb.limit(8);
    BigInteger bi = Unsigned.getUnsignedLong(bb);
    BigInteger uLongMax = new BigInteger(ULONG_MAX);
    for (int i = 0; i < uLongMax.bitCount(); ++i) {
        TestCase.assertTrue("Bit: " + i + " should be: " + uLongMax.testBit(i),
                uLongMax.testBit(i) == bi.testBit(i));
    }
    TestCase.assertEquals(ULONG_MAX, bi.toString());
View Full Code Here

Examples of java.math.BigInteger.bitCount()

50
51
52
53
54
55
56
57
58
59
60
    bb.put((byte)0x00);
    bb.position(0);
    bb.limit(10);
    bi = Unsigned.getUnsignedLong(bb, 1);
    uLongMax = new BigInteger(ULONG_MAX);
    for (int i = 0; i < uLongMax.bitCount(); ++i) {
        TestCase.assertTrue("Bit: " + i + " should be: " + uLongMax.testBit(i),
                uLongMax.testBit(i) == bi.testBit(i));
    }
    TestCase.assertEquals(ULONG_MAX, bi.toString());
  }
View Full Code Here

Examples of java.math.BigInteger.bitCount()

129
130
131
132
133
134
135
136
137
138
139
            for (int j=0; j<32; j++) {
                bitCount += ((tmp & 1) == bit ? 1 : 0);
                tmp >>= 1;
            }

            if (bigX.bitCount() != bitCount) {
                //System.err.println(x+": "+bitCount+", "+bigX.bitCount());
                failCount++;
            }
        }
        report("Bit Count", failCount);
View Full Code Here

Examples of java.math.BigInteger.bitCount()

39
40
41
42
43
44
45
46
47
48
49
      throw new AssertionFailedError("identified bug - sign bit not masked out of exponent");
    }
    assertEquals(2, hd.getBinaryExponent());
    BigInteger frac = hd.getSignificand();
    assertEquals(64, frac.bitLength());
    assertEquals(1, frac.bitCount());
  }

  public void testSubnormal() {
    ExpandedDouble hd = new ExpandedDouble(0x0000000000000001L);
View Full Code Here

Examples of java.math.BigInteger.bitCount()

51
52
53
54
55
56
57
58
59
60
61
      throw new AssertionFailedError("identified bug - subnormal numbers not decoded properly");
    }
    assertEquals(-1086, hd.getBinaryExponent());
    BigInteger frac = hd.getSignificand();
    assertEquals(64, frac.bitLength());
    assertEquals(1, frac.bitCount());
  }

  /**
   * Tests specific values for conversion from {@link ExpandedDouble} to {@link NormalisedDecimal} and back
   */
 
View Full Code Here

Examples of java.math.BigInteger.bitCount()

51
52
53
54
55
56
57
58
59
60
61
        int upperIndex = length;

        /* Count up to 2^13 - 1 and find all those values that have N bits on */
        for (int count = 0; count < 8192; count++) {
            BigInteger bi = new BigInteger(Integer.toString(count));
            if (bi.bitCount() != n) continue;
            // Reverse bits
            int reversed = 0;
            int reverseCount = count;
            for (int i = 0; i < 13; i++) {
                reversed = reversed << 1;
View Full Code Here

Examples of java.math.BigInteger.bitCount()

520
521
522
523
524
525
526
527
528
529
530
      assertTrue("a==b", a.equals(b));
      assertTrue("a >> i == bi3", a.shiftRight(i).equals(bi3));
      a = a.shiftLeft(1);
      assertTrue("<<1 == *2", b.multiply(two).equals(a));
      assertTrue("a non-neg", a.signum() >= 0);
      assertTrue("a.bitCount==b.bitCount", a.bitCount() == b.bitCount());

      BigInteger d = minusOne.shiftLeft(i);
      assertTrue("c==d", c.equals(d));
      c = c.shiftLeft(1);
      assertTrue("<<1 == *2 negative", d.multiply(two).equals(c));
View Full Code Here

Examples of java.math.BigInteger.bitCount()

33
34
35
36
37
38
39
40
41
42
43
    /**
     * bitCount() of zero.
     */
    public void testBitCountZero() {
        BigInteger aNumber = new BigInteger("0");
        assertEquals(0, aNumber.bitCount());
    }

    /**
     * bitCount() of a negative number.
     */
 
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.