Cross Reference: /openjdk7/jdk/src/share/classes/java/text/DigitList.java

Lines Matching defs:maximumDigits
283      * @param maximumDigits The most fractional or total digits which should
285      * @param fixedPoint If true, then maximumDigits is the maximum
288     final void set(boolean isNegative, double source, int maximumDigits, boolean fixedPoint) {
289         set(isNegative, Double.toString(source), maximumDigits, fixedPoint);
296     final void set(boolean isNegative, String s, int maximumDigits, boolean fixedPoint) {
341             if (-decimalAt > maximumDigits) {
346             } else if (-decimalAt == maximumDigits) {
368         round(fixedPoint ? (maximumDigits + decimalAt) : maximumDigits);
373      * @param maximumDigits The maximum number of digits to be shown.
374      * Upon return, count will be less than or equal to maximumDigits.
376     private final void round(int maximumDigits) {
379         if (maximumDigits >= 0 && maximumDigits < count) {
380             if (shouldRoundUp(maximumDigits)) {
385                     --maximumDigits;
386                     if (maximumDigits < 0) {
391                         maximumDigits = 0; // Adjust the count
395                     ++digits[maximumDigits];
396                     if (digits[maximumDigits] <= '9') break;
397                     // digits[maximumDigits] = '0'; // Unnecessary since we'll truncate this
399                 ++maximumDigits; // Increment for use as count
401             count = maximumDigits;
417      * @param maximumDigits the number of digits to keep, from 0 to
423      * @return true if digit <code>maximumDigits-1</code> should be
426     private boolean shouldRoundUp(int maximumDigits) {
427         if (maximumDigits < count) {
430                 for (int i=maximumDigits; i<count; ++i) {
439                 for (int i=maximumDigits; i<count; ++i) {
446                 for (int i=maximumDigits; i<count; ++i) {
453                 if (digits[maximumDigits] >= '5') {
458                 if (digits[maximumDigits] > '5') {
460                 } else if (digits[maximumDigits] == '5' ) {
461                     for (int i=maximumDigits+1; i<count; ++i) {
470                 if (digits[maximumDigits] > '5') {
472                 } else if (digits[maximumDigits] == '5' ) {
473                     for (int i=maximumDigits+1; i<count; ++i) {
478                     return maximumDigits > 0 && (digits[maximumDigits-1] % 2 != 0);
482                 for (int i=maximumDigits; i<count; ++i) {
508      * @param maximumDigits The most digits which should be converted.
509      * If maximumDigits is lower than the number of significant digits
512     public final void set(boolean isNegative, long source, int maximumDigits) {
545         if (maximumDigits > 0) round(maximumDigits);
553      * @param maximumDigits The most fractional or total digits which should
555      * @param fixedPoint If true, then maximumDigits is the maximum
558     final void set(boolean isNegative, BigDecimal source, int maximumDigits, boolean fixedPoint) {
562         set(isNegative, s, maximumDigits, fixedPoint);
569      * @param maximumDigits The most digits which should be converted.
570      * If maximumDigits is lower than the number of significant digits
573     final void set(boolean isNegative, BigInteger source, int maximumDigits) {
586         if (maximumDigits > 0) {
587             round(maximumDigits);