Chromium Code Reviews| OLD | NEW |
|---|---|
| (Empty) | |
| 1 // Copyright 2010 the V8 project authors. All rights reserved. | |
| 2 // Redistribution and use in source and binary forms, with or without | |
| 3 // modification, are permitted provided that the following conditions are | |
| 4 // met: | |
| 5 // | |
| 6 // * Redistributions of source code must retain the above copyright | |
| 7 // notice, this list of conditions and the following disclaimer. | |
| 8 // * Redistributions in binary form must reproduce the above | |
| 9 // copyright notice, this list of conditions and the following | |
| 10 // disclaimer in the documentation and/or other materials provided | |
| 11 // with the distribution. | |
| 12 // * Neither the name of Google Inc. nor the names of its | |
| 13 // contributors may be used to endorse or promote products derived | |
| 14 // from this software without specific prior written permission. | |
| 15 // | |
| 16 // THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS | |
| 17 // "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT | |
| 18 // LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR | |
| 19 // A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT | |
| 20 // OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, | |
| 21 // SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT | |
| 22 // LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, | |
| 23 // DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY | |
| 24 // THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT | |
| 25 // (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE | |
| 26 // OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. | |
| 27 | |
| 28 #ifndef V8_BIGNUM_DTOA_H_ | |
| 29 #define V8_BIGNUM_DTOA_H_ | |
| 30 | |
| 31 namespace v8 { | |
| 32 namespace internal { | |
| 33 | |
| 34 enum BignumDtoaMode { | |
| 35 // 0.9999999999999999 becomes 0.1 | |
|
William Hesse
2010/11/15 15:48:30
Better description, not just an example.
Or say "
Florian Loitsch
2010/11/16 14:32:06
Done.
| |
| 36 BIGNUM_DTOA_SHORTEST, | |
| 37 // Fixed number of digits after the comma. | |
|
William Hesse
2010/11/15 15:48:30
Return a fixed number of digits after the decimal
Florian Loitsch
2010/11/16 14:32:06
Done.
| |
| 38 // For instance fixed(0.1, 4) becomes 0.1000 | |
| 39 // If the input number is big, the output will be big. | |
| 40 BIGNUM_DTOA_FIXED, | |
| 41 // Fixed number of digits (independent of the comma). | |
|
William Hesse
2010/11/15 15:48:30
Return a fixed number of digits, no matter what th
Florian Loitsch
2010/11/16 14:32:06
Done.
| |
| 42 BIGNUM_DTOA_PRECISION | |
| 43 }; | |
| 44 | |
| 45 // Converts the given double 'v' to ascii. | |
| 46 // The result should be interpreted as buffer * 10^(point-length). | |
| 47 // The buffer will be null-terminated. | |
| 48 // | |
| 49 // The input v must be > 0 and different from NaN, and Infinity. | |
| 50 // | |
| 51 // The output depends on the given mode: | |
| 52 // - SHORTEST: produce the least amount of digits for which the internal | |
| 53 // identity requirement is still satisfied. If the digits are printed | |
| 54 // (together with the correct exponent) then reading this number will give | |
| 55 // 'v' again. The buffer will choose the representation that is closest to | |
| 56 // 'v'. If there are two at the same distance, than the number is round up. | |
| 57 // In this mode the 'requested_digits' parameter is ignored. | |
| 58 // - FIXED: produces digits necessary to print a given number with | |
| 59 // 'requested_digits' digits after the comma. The produced digits might be too | |
|
William Hesse
2010/11/15 15:48:30
decimal point, radix point.
Florian Loitsch
2010/11/16 14:32:06
Done.
| |
| 60 // short in which case the caller has to fill the gaps with '0's. | |
| 61 // Example: toFixed(0.001, 5) is allowed to return buffer="1", point=-2. | |
| 62 // Halfway cases are rounded up. The call toFixed(0.15, 2) thus returns | |
| 63 // buffer="2", point=0. | |
| 64 // Note: the length of the returned buffer has no meaning wrt the significance | |
| 65 // of its digits. That is, just because it contains '0's does not mean that | |
| 66 // any other digit would not satisfy the internal identity requirement. | |
| 67 // - PRECISION: produces 'requested_digits' where the first digit is not '0'. | |
| 68 // Even though the length of produced digits usually equals | |
| 69 // 'requested_digits', the function is allowed to return less digits, in which | |
|
William Hesse
2010/11/15 15:48:30
fewer
Florian Loitsch
2010/11/16 14:32:06
Done.
| |
| 70 // case the caller has to fill the missing digits with '0's. | |
| 71 // Halfway cases are again rounded up. | |
| 72 // The given memory-management functions are only needed for internal bignum | |
|
William Hesse
2010/11/15 15:48:30
No memory management functions are passed in anymo
Florian Loitsch
2010/11/16 14:32:06
Done.
| |
| 73 // computations. If they are NULL then the system ones will be used. | |
| 74 // 'DoubleToAscii' expects the given buffer to be big enough to hold all digits | |
| 75 // and a terminating null-character. | |
| 76 void BignumDtoa(double v, BignumDtoaMode mode, int requested_digits, | |
| 77 Vector<char> buffer, int* length, int* point); | |
| 78 | |
| 79 } } // namespace v8::internal | |
| 80 | |
| 81 #endif // V8_BIGNUM_DTOA_H_ | |
| OLD | NEW |