Lines Matching defs:upper
566 // unsigned 32-bit integer. ASCII letters are conventionally upper case.
10366 // m_max_incl is an inclusive upper bound on the backing array size.
13903 // Compute lower and upper bounds such that any number between them (possibly
13927 // Next, the upper bound. Our number f is:
13933 // The upper bound is halfway between them (noting that 52 became 53):
13935 wuffs_base__private_implementation__high_prec_dec upper;
13937 &upper, (2 * mantissa) + 1, false);
13938 wuffs_base__private_implementation__high_prec_dec__lshift(&upper, exp2 - 53);
13940 // The lower and upper bounds are possible outputs only if the original
13946 // within the upper bound. This is tracked by upper_delta:
13947 // - When -1, the digits of h and upper are the same so far.
13948 // - When +0, we saw a difference of 1 between h and upper on a previous
13949 // digit and subsequently only 9s for h and 0s for upper. Thus, rounding
13959 // digits until h has distinguished itself from lower or upper.
13962 // number) and u (upper).
13964 // The lower, h and upper numbers may have their decimal points at different
13965 // places. In this case, upper is the longest, so we iterate ui starting from
13970 int32_t hi = ui - upper.decimal_point + h->decimal_point;
13977 int32_t li = ui - upper.decimal_point + lower.decimal_point;
13987 // Calculate ud, the upper bound's digit, and update upper_delta.
13988 uint8_t ud = (((uint32_t)ui) < upper.num_digits) ? upper.digits[ui] : 0;
13993 // upper = 12347???
13998 // upper = 12346???
14005 // upper = 1234600?
14010 // We can round up if upper has a different digit than h and either upper
14011 // is inclusive or upper is bigger than the result of rounding up.
14015 (inclusive || ((ui + 1) < ((int32_t)(upper.num_digits)))));
14113 // for the product (man * e), where e is (10 ** exp10). The upper bound would
14153 // again, see if the upper bound is large enough to produce a different