Lines Matching defs:lower
5241 // the left side (lower indexes). The default is vice versa: rendering on the
10822 // the network), use Wuffs' lower level C API instead of its higher level,
13268 // infinity, lower than -2047 means zero.
13903 // Compute lower and upper bounds such that any number between them (possibly
13904 // inclusive) will round to f. First, the lower bound. Our number f is:
13913 // The lower bound is halfway between them (noting that 52 became 53):
13921 wuffs_base__private_implementation__high_prec_dec lower;
13923 &lower, (2 * l_mantissa) + 1, false);
13924 wuffs_base__private_implementation__high_prec_dec__lshift(&lower,
13940 // The lower and upper bounds are possible outputs only if the original
13959 // digits until h has distinguished itself from lower or upper.
13961 // The zi and zd variables are indexes and digits, for z in l (lower), h (the
13964 // The lower, h and upper numbers may have their decimal points at different
13976 // Calculate ld, the lower bound's digit.
13977 int32_t li = ui - upper.decimal_point + lower.decimal_point;
13978 uint8_t ld = (((uint32_t)li) < lower.num_digits) ? lower.digits[li] : 0;
13980 // We can round down (truncate) if lower has a different digit than h or if
13981 // lower is inclusive and is exactly the result of rounding down (i.e. we
13982 // have reached the final digit of lower).
13985 (inclusive && ((li + 1) == ((int32_t)(lower.num_digits))));
14112 // entry was possibly truncated. We have so far only calculated a lower bound
14114 // add a further (man * 1) to the 128-bit product, which overflows the lower
14152 // The "high resolution" approximation of e is still a lower bound. Once