Lines Matching defs:exponent
116 int exponent,
129 exponent + (buffer.length() - kMaxSignificantDecimalDigits);
168 // Compute the binary exponent.
169 int exponent = 0;
170 *result = DiyFp(significand, exponent);
177 int exponent,
191 // If the 10^exponent (resp. 10^-exponent) fits into a double too then we
196 if (exponent < 0 && -exponent < kExactPowersOfTenSize) {
197 // 10^-exponent fits into a double.
200 *result /= exact_powers_of_ten[-exponent];
203 if (0 <= exponent && exponent < kExactPowersOfTenSize) {
204 // 10^exponent fits into a double.
207 *result *= exact_powers_of_ten[exponent];
212 if ((0 <= exponent) &&
213 (exponent - remaining_digits < kExactPowersOfTenSize)) {
215 // 10^remaining_digits. As a result the remaining exponent now fits
220 *result *= exact_powers_of_ten[exponent - remaining_digits];
228 // Returns 10^exponent as an exact DiyFp.
229 // The given exponent must be in the range [1; kDecimalExponentDistance[.
230 static DiyFp AdjustmentPowerOfTen(int exponent) {
231 ASSERT(0 < exponent);
232 ASSERT(exponent < PowersOfTenCache::kDecimalExponentDistance);
233 // Simply hardcode the remaining powers for the given decimal exponent
236 switch (exponent) {
255 int exponent,
267 // Move the remaining decimals into the exponent.
268 exponent += remaining_decimals;
275 ASSERT(exponent <= PowersOfTenCache::kMaxDecimalExponent);
276 if (exponent < PowersOfTenCache::kMinDecimalExponent) {
282 PowersOfTenCache::GetCachedPowerForDecimalExponent(exponent,
286 if (cached_decimal_exponent != exponent) {
287 int adjustment_exponent = exponent - cached_decimal_exponent;
364 // Returns the correct double for the buffer*10^exponent.
368 // buffer.length() + exponent <= kMaxDecimalPower + 1
369 // buffer.length() + exponent > kMinDecimalPower
372 int exponent,
380 ASSERT(buffer.length() + exponent <= kMaxDecimalPower + 1);
381 ASSERT(buffer.length() + exponent > kMinDecimalPower);
392 if (exponent >= 0) {
393 input.MultiplyByPowerOfTen(exponent);
395 boundary.MultiplyByPowerOfTen(-exponent);
416 double Strtod(BufferReference<const char> buffer, int exponent) {
419 exponent += left_trimmed.length() - trimmed.length();
424 TrimToMaxSignificantDigits(trimmed, exponent,
430 if (exponent + trimmed.length() - 1 >= kMaxDecimalPower) {
433 if (exponent + trimmed.length() <= kMinDecimalPower) {
438 if (DoubleStrtod(trimmed, exponent, &guess) ||
439 DiyFpStrtod(trimmed, exponent, &guess)) {
442 return BignumStrtod(trimmed, exponent, guess);