/**

private final BigInteger intVal;

/**

private final int scale; // Note: this may have any value, so

// calculations must be done in longs

/**

private transient int precision;

/**

private transient String stringCache;

/**

static final long INFLATED = Long.MIN_VALUE;

private static final BigInteger INFLATED_BIGINT = BigInteger.valueOf(INFLATED);

/**

private final transient long intCompact;

// All 18-digit base ten strings fit into a long; not all 19-digit

// strings will

private static final int MAX_COMPACT_DIGITS = 18;

/* Appease the serialization gods */

private static final long serialVersionUID = 6108874887143696463L;

private static final ThreadLocal<StringBuilderHelper>

threadLocalStringBuilderHelper = new ThreadLocal<StringBuilderHelper>() {

@Override

protected StringBuilderHelper initialValue() {

return new StringBuilderHelper();

}

};

// Cache of common small BigDecimal values.

private static final BigDecimal zeroThroughTen[] = {

new BigDecimal(BigInteger.ZERO, 0, 0, 1),

new BigDecimal(BigInteger.ONE, 1, 0, 1),

new BigDecimal(BigInteger.valueOf(2), 2, 0, 1),

new BigDecimal(BigInteger.valueOf(3), 3, 0, 1),

new BigDecimal(BigInteger.valueOf(4), 4, 0, 1),

new BigDecimal(BigInteger.valueOf(5), 5, 0, 1),

new BigDecimal(BigInteger.valueOf(6), 6, 0, 1),

new BigDecimal(BigInteger.valueOf(7), 7, 0, 1),

new BigDecimal(BigInteger.valueOf(8), 8, 0, 1),

new BigDecimal(BigInteger.valueOf(9), 9, 0, 1),

new BigDecimal(BigInteger.TEN, 10, 0, 2),

};

// Cache of zero scaled by 0 - 15

private static final BigDecimal[] ZERO_SCALED_BY = {

zeroThroughTen[0],

new BigDecimal(BigInteger.ZERO, 0, 1, 1),

new BigDecimal(BigInteger.ZERO, 0, 2, 1),

new BigDecimal(BigInteger.ZERO, 0, 3, 1),

new BigDecimal(BigInteger.ZERO, 0, 4, 1),

new BigDecimal(BigInteger.ZERO, 0, 5, 1),

new BigDecimal(BigInteger.ZERO, 0, 6, 1),

new BigDecimal(BigInteger.ZERO, 0, 7, 1),

new BigDecimal(BigInteger.ZERO, 0, 8, 1),

new BigDecimal(BigInteger.ZERO, 0, 9, 1),

new BigDecimal(BigInteger.ZERO, 0, 10, 1),

new BigDecimal(BigInteger.ZERO, 0, 11, 1),

new BigDecimal(BigInteger.ZERO, 0, 12, 1),

new BigDecimal(BigInteger.ZERO, 0, 13, 1),

new BigDecimal(BigInteger.ZERO, 0, 14, 1),

new BigDecimal(BigInteger.ZERO, 0, 15, 1),

};

// Half of Long.MIN_VALUE & Long.MAX_VALUE.

private static final long HALF_LONG_MAX_VALUE = Long.MAX_VALUE / 2;

private static final long HALF_LONG_MIN_VALUE = Long.MIN_VALUE / 2;

// Constants

/**

public static final BigDecimal ZERO =

zeroThroughTen[0];

/**

public static final BigDecimal ONE =

zeroThroughTen[1];

/**

public static final BigDecimal TEN =

zeroThroughTen[10];

// Constructors

/**

BigDecimal(BigInteger intVal, long val, int scale, int prec) {

this.scale = scale;

this.precision = prec;

this.intCompact = val;

this.intVal = intVal;

}

/**

public BigDecimal(char[] in, int offset, int len) {

this(in,offset,len,MathContext.UNLIMITED);

}

/**

public BigDecimal(char[] in, int offset, int len, MathContext mc) {

// protect against huge length, negative values, and integer overflow

if ((in.length | len | offset) < 0 || len > in.length - offset) {

throw new NumberFormatException

("Bad offset or len arguments for char[] input.");

}

// This is the primary string to BigDecimal constructor; all

// incoming strings end up here; it uses explicit (inline)

// parsing for speed and generates at most one intermediate

// (temporary) object (a char[] array) for non-compact case.

// Use locals for all fields values until completion

int prec = 0; // record precision value

int scl = 0; // record scale value

long rs = 0; // the compact value in long

BigInteger rb = null; // the inflated value in BigInteger

// use array bounds checking to handle too-long, len == 0,

// bad offset, etc.

try {

// handle the sign

boolean isneg = false; // assume positive

if (in[offset] == '-') {

isneg = true; // leading minus means negative

offset++;

len--;

} else if (in[offset] == '+') { // leading + allowed

offset++;

len--;

}

// should now be at numeric part of the significand

boolean dot = false; // true when there is a '.'

long exp = 0; // exponent

char c; // current character

boolean isCompact = (len <= MAX_COMPACT_DIGITS);

// integer significand array & idx is the index to it. The array

// is ONLY used when we can't use a compact representation.

int idx = 0;

if (isCompact) {

// First compact case, we need not to preserve the character

// and we can just compute the value in place.

for (; len > 0; offset++, len--) {

c = in[offset];

if ((c == '0')) { // have zero

if (prec == 0)

prec = 1;

else if (rs != 0) {

rs *= 10;

++prec;

} // else digit is a redundant leading zero

if (dot)

++scl;

} else if ((c >= '1' && c <= '9')) { // have digit

int digit = c - '0';

if (prec != 1 || rs != 0)

++prec; // prec unchanged if preceded by 0s

rs = rs * 10 + digit;

if (dot)

++scl;

} else if (c == '.') { // have dot

// have dot

if (dot) // two dots

throw new NumberFormatException();

dot = true;

} else if (Character.isDigit(c)) { // slow path

int digit = Character.digit(c, 10);

if (digit == 0) {

if (prec == 0)

prec = 1;

else if (rs != 0) {

rs *= 10;

++prec;

} // else digit is a redundant leading zero

} else {

if (prec != 1 || rs != 0)

++prec; // prec unchanged if preceded by 0s

rs = rs * 10 + digit;

}

if (dot)

++scl;

} else if ((c == 'e') || (c == 'E')) {

exp = parseExp(in, offset, len);

// Next test is required for backwards compatibility

if ((int) exp != exp) // overflow

throw new NumberFormatException();

break; // [saves a test]

} else {

throw new NumberFormatException();

}

}

if (prec == 0) // no digits found

throw new NumberFormatException();

// Adjust scale if exp is not zero.

if (exp != 0) { // had significant exponent

scl = adjustScale(scl, exp);

}

rs = isneg ? -rs : rs;

int mcp = mc.precision;

int drop = prec - mcp; // prec has range [1, MAX_INT], mcp has range [0, MAX_INT];

// therefore, this subtract cannot overflow

if (mcp > 0 && drop > 0) { // do rounding

while (drop > 0) {

scl = checkScaleNonZero((long) scl - drop);

rs = divideAndRound(rs, LONG_TEN_POWERS_TABLE[drop], mc.roundingMode.oldMode);

prec = longDigitLength(rs);

drop = prec - mcp;

}

}

} else {

char coeff[] = new char[len];

for (; len > 0; offset++, len--) {

c = in[offset];

// have digit

if ((c >= '0' && c <= '9') || Character.isDigit(c)) {

// First compact case, we need not to preserve the character

// and we can just compute the value in place.

if (c == '0' || Character.digit(c, 10) == 0) {

if (prec == 0) {

coeff[idx] = c;

prec = 1;

} else if (idx != 0) {

coeff[idx++] = c;

++prec;

} // else c must be a redundant leading zero

} else {

if (prec != 1 || idx != 0)

++prec; // prec unchanged if preceded by 0s

coeff[idx++] = c;

}

if (dot)

++scl;

continue;

}

// have dot

if (c == '.') {

// have dot

if (dot) // two dots

throw new NumberFormatException();

dot = true;

continue;

}

// exponent expected

if ((c != 'e') && (c != 'E'))

throw new NumberFormatException();

exp = parseExp(in, offset, len);

// Next test is required for backwards compatibility

if ((int) exp != exp) // overflow

throw new NumberFormatException();

break; // [saves a test]

}

// here when no characters left

if (prec == 0) // no digits found

throw new NumberFormatException();

// Adjust scale if exp is not zero.

if (exp != 0) { // had significant exponent

scl = adjustScale(scl, exp);

}

// Remove leading zeros from precision (digits count)

rb = new BigInteger(coeff, isneg ? -1 : 1, prec);

rs = compactValFor(rb);

int mcp = mc.precision;

if (mcp > 0 && (prec > mcp)) {

if (rs == INFLATED) {

int drop = prec - mcp;

while (drop > 0) {

scl = checkScaleNonZero((long) scl - drop);

rb = divideAndRoundByTenPow(rb, drop, mc.roundingMode.oldMode);

rs = compactValFor(rb);

if (rs != INFLATED) {

prec = longDigitLength(rs);

break;

}

prec = bigDigitLength(rb);

drop = prec - mcp;

}

}

if (rs != INFLATED) {

int drop = prec - mcp;

while (drop > 0) {

scl = checkScaleNonZero((long) scl - drop);

rs = divideAndRound(rs, LONG_TEN_POWERS_TABLE[drop], mc.roundingMode.oldMode);

prec = longDigitLength(rs);

drop = prec - mcp;

}

rb = null;

}

}

}

} catch (ArrayIndexOutOfBoundsException e) {

throw new NumberFormatException();

} catch (NegativeArraySizeException e) {

throw new NumberFormatException();

}

this.scale = scl;

this.precision = prec;

this.intCompact = rs;

this.intVal = rb;

}

private int adjustScale(int scl, long exp) {

long adjustedScale = scl - exp;

if (adjustedScale > Integer.MAX_VALUE || adjustedScale < Integer.MIN_VALUE)

throw new NumberFormatException("Scale out of range.");

scl = (int) adjustedScale;

return scl;

}

/*

private static long parseExp(char[] in, int offset, int len){

long exp = 0;

offset++;

char c = in[offset];

len--;

boolean negexp = (c == '-');

// optional sign

if (negexp || c == '+') {

offset++;

c = in[offset];

len--;

}

if (len <= 0) // no exponent digits

throw new NumberFormatException();

// skip leading zeros in the exponent

while (len > 10 && (c=='0' || (Character.digit(c, 10) == 0))) {

offset++;

c = in[offset];

len--;

}

if (len > 10) // too many nonzero exponent digits

throw new NumberFormatException();

// c now holds first digit of exponent

for (;; len--) {

int v;

if (c >= '0' && c <= '9') {

v = c - '0';

} else {

v = Character.digit(c, 10);

if (v < 0) // not a digit

throw new NumberFormatException();

}

exp = exp * 10 + v;

if (len == 1)

break; // that was final character

offset++;

c = in[offset];

}

if (negexp) // apply sign

exp = -exp;

return exp;

}

/**

public BigDecimal(char[] in) {

this(in, 0, in.length);

}

/**

public BigDecimal(char[] in, MathContext mc) {

this(in, 0, in.length, mc);

}

/**

public BigDecimal(String val) {

this(val.toCharArray(), 0, val.length());

}

/**

public BigDecimal(String val, MathContext mc) {

this(val.toCharArray(), 0, val.length(), mc);

}

/**

public BigDecimal(double val) {

this(val,MathContext.UNLIMITED);

}

/**

public BigDecimal(double val, MathContext mc) {

if (Double.isInfinite(val) || Double.isNaN(val))

throw new NumberFormatException("Infinite or NaN");

// Translate the double into sign, exponent and significand, according

// to the formulae in JLS, Section 20.10.22.

long valBits = Double.doubleToLongBits(val);

int sign = ((valBits >> 63) == 0 ? 1 : -1);

int exponent = (int) ((valBits >> 52) & 0x7ffL);

long significand = (exponent == 0

? (valBits & ((1L << 52) - 1)) << 1

: (valBits & ((1L << 52) - 1)) | (1L << 52));

exponent -= 1075;

// At this point, val == sign * significand * 2**exponent.

/*

if (significand == 0) {

this.intVal = BigInteger.ZERO;

this.scale = 0;

this.intCompact = 0;

this.precision = 1;

return;

}

// Normalize

while ((significand & 1) == 0) { // i.e., significand is even

significand >>= 1;

exponent++;

}

int scale = 0;

// Calculate intVal and scale

BigInteger intVal;

long compactVal = sign * significand;

if (exponent == 0) {

intVal = (compactVal == INFLATED) ? INFLATED_BIGINT : null;

} else {

if (exponent < 0) {

intVal = BigInteger.valueOf(5).pow(-exponent).multiply(compactVal);

scale = -exponent;

} else { // (exponent > 0)

intVal = BigInteger.valueOf(2).pow(exponent).multiply(compactVal);

}

compactVal = compactValFor(intVal);

}

int prec = 0;

int mcp = mc.precision;

if (mcp > 0) { // do rounding

int mode = mc.roundingMode.oldMode;

int drop;

if (compactVal == INFLATED) {

prec = bigDigitLength(intVal);

drop = prec - mcp;

while (drop > 0) {

scale = checkScaleNonZero((long) scale - drop);

intVal = divideAndRoundByTenPow(intVal, drop, mode);

compactVal = compactValFor(intVal);

if (compactVal != INFLATED) {

break;

}

prec = bigDigitLength(intVal);

drop = prec - mcp;

}

}

if (compactVal != INFLATED) {

prec = longDigitLength(compactVal);

drop = prec - mcp;

while (drop > 0) {

scale = checkScaleNonZero((long) scale - drop);

compactVal = divideAndRound(compactVal, LONG_TEN_POWERS_TABLE[drop], mc.roundingMode.oldMode);

prec = longDigitLength(compactVal);

drop = prec - mcp;

}

intVal = null;

}

}

this.intVal = intVal;

this.intCompact = compactVal;

this.scale = scale;

this.precision = prec;

}

/**

public BigDecimal(BigInteger val) {

scale = 0;

intVal = val;

intCompact = compactValFor(val);

}

/**