Cross Reference: /openjdk7/jdk/src/share/classes/java/math/BigInteger.java

Lines Matching refs:sign
61  * {@code or}, {@code xor}) implicitly perform sign extension on the shorter
73  * representation of their operand.  If necessary, the operand is sign-
75  * operations can produce a BigInteger with a different sign from the
78  * are infinitely many "virtual sign bits" preceding each BigInteger.
221      * Translates the sign-magnitude representation of a BigInteger into a
222      * BigInteger.  The sign is represented as an integer signum value: -1 for
252      * A constructor for internal use that translates the sign-magnitude
275      * consists of an optional minus or plus sign followed by a
298         // Check for at most one leading sign
299         int sign = 1;
303             // No leading sign character or at most one leading sign character
310                 sign = -1;
312             throw new NumberFormatException("Illegal embedded sign character");
325         signum = sign;
361         // Check for leading minus sign
362         int sign = 1;
366             sign = -1;
384         signum = sign;
465      * sign followed by a sequence of one or more decimal digits.  The
2387      * representation of this BigInteger, <i>excluding</i> a sign bit.
2393      *         representation of this BigInteger, <i>excluding</i> a sign bit.
2423      * of this BigInteger that differ from its sign bit.  This method is
2427      *         of this BigInteger that differ from its sign bit.
2508      * BigInteger's. This is the version of compareTo ignoring sign.
2610      * sign is prepended if appropriate.  (This representation is
2647         // Put sign (if any) and first digit group into result buffer
2676      * {@code Character.forDigit} is used, and a minus sign is
2695      * least one sign bit, which is {@code (ceil((this.bitLength() +
2730      * result with the opposite sign.
2750      * result with the opposite sign.
2862         // Find first non-sign (0xff) byte of input
2867         /* Allocate output array.  If all non-sign bytes are 0x00, we must
2909         // Find first non-sign (0xffffffff) int of input
2913         /* Allocate output array.  If all non-sign ints are 0x00, we must
2991      * including space for at least one sign bit.
2997     /* Returns sign bit */
3002     /* Returns an int of sign bits */
3011      * sign ints).
3099         int sign = fields.get("signum", -2);
3103         if (sign < -1 || sign > 1) {
3109         if ((magnitude.length == 0) != (sign == 0)) {
3117         unsafe.putIntVolatile(this, signumOffset, sign);