Lines Matching refs:number
51 // Adjusts the last digit of the generated number, and screens out generated
64 // representable number to the input.
82 // Basically the buffer currently contains a number in the unsafe interval
116 // and v (the input number). They are guaranteed to be precise up to one unit.
123 // If the number inside the buffer lies inside the unsafe interval but not
139 // 3) decrementing the buffer would yield a number below w_high and farther
140 // away than the current number. In other words:
197 // a unit of 50 means that the real number lies within rest +/- 50. If
239 // number. We furthermore receive the maximum number of bits 'number' has.
241 // The number of bits must be <= 32.
242 // Precondition: number < (1 << (number_bits + 1)).
243 static void BiggestPowerTen(uint32_t number,
251 if (kTen9 <= number) {
259 if (kTen8 <= number) {
267 if (kTen7 <= number) {
276 if (kTen6 <= number) {
284 if (kTen5 <= number) {
292 if (kTen4 <= number) {
301 if (1000 <= number) {
309 if (100 <= number) {
317 if (10 <= number) {
325 if (1 <= number) {
343 // Generates the digits of input number w.
344 // w is a floating-point number (DiyFp), consisting of a significand and an
359 // * buffer is not null-terminated, but len contains the number of digits.
363 // * if more than one decimal representation gives the minimal number of
409 // generated number in.
411 // We now cut the input number into two parts: the integral digits and the
446 // Rounding down (by not emitting the remaining digits) yields a number
483 // Generates (at most) requested_digits of input number w.
484 // w is a floating-point number (DiyFp), consisting of a significand and an
498 // * buffer is not null-terminated, but length contains the number of
522 // We cut the input number into two parts: the integral digits and the
606 // closest floating-point neighbors. Any number strictly between
661 // number of digits. This version does not generate the shortest representation,
700 // limited number of digits.)
