Lines Matching defs:number
99 uint32_t number = static_cast<uint32_t>(value);
102 number = static_cast<uint32_t>(-value);
106 if (factor > number) break;
110 buffer_[position_ - i] = '0' + static_cast<char>(number % 10);
111 number /= 10;
193 int64_t number = 0;
217 number = number * radix + digit;
218 int overflow = static_cast<int>(number >> 53);
229 int dropped_bits = static_cast<int>(number) & dropped_bits_mask;
230 number >>= overflow_bits_count;
247 number++; // Rounding up.
251 if ((number & 1) != 0 || !zero_tail) {
252 number++; // Rounding up.
257 if ((number & (static_cast<int64_t>(1) << 53)) != 0) {
259 number >>= 1;
266 DCHECK(number < ((int64_t)1 << 53));
267 DCHECK(static_cast<int64_t>(static_cast<double>(number)) == number);
271 if (number == 0) return -0.0;
272 number = -number;
274 return static_cast<double>(number);
277 DCHECK_NE(number, 0);
278 return std::ldexp(static_cast<double>(negative ? -number : number), exponent);
552 // If the number has more than kMaxSignificantDigits it will be parsed
653 // Maximum number of significant digits in decimal representation.
656 // (768 digits). If we parse a number whose first digits are equal to a
662 // The longest form of simplified number is: "-<significant digits>'.1eXXX\0".
1057 // (see ES section 7.1.12.1 #sec-tostring-applied-to-the-number-type)
1241 // before the point. The number of requested_digits equals hence f + 1.