| OLD | NEW |
| 1 // Copyright 2011 the V8 project authors. All rights reserved. | 1 // Copyright 2011 the V8 project authors. All rights reserved. |
| 2 // Redistribution and use in source and binary forms, with or without | 2 // Redistribution and use in source and binary forms, with or without |
| 3 // modification, are permitted provided that the following conditions are | 3 // modification, are permitted provided that the following conditions are |
| 4 // met: | 4 // met: |
| 5 // | 5 // |
| 6 // * Redistributions of source code must retain the above copyright | 6 // * Redistributions of source code must retain the above copyright |
| 7 // notice, this list of conditions and the following disclaimer. | 7 // notice, this list of conditions and the following disclaimer. |
| 8 // * Redistributions in binary form must reproduce the above | 8 // * Redistributions in binary form must reproduce the above |
| 9 // copyright notice, this list of conditions and the following | 9 // copyright notice, this list of conditions and the following |
| 10 // disclaimer in the documentation and/or other materials provided | 10 // disclaimer in the documentation and/or other materials provided |
| (...skipping 10 matching lines...) Expand all Loading... |
| 21 // SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT | 21 // SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT |
| 22 // LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, | 22 // LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, |
| 23 // DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY | 23 // DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY |
| 24 // THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT | 24 // THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT |
| 25 // (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE | 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. | 26 // OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
| 27 | 27 |
| 28 #ifndef V8_CONVERSIONS_H_ | 28 #ifndef V8_CONVERSIONS_H_ |
| 29 #define V8_CONVERSIONS_H_ | 29 #define V8_CONVERSIONS_H_ |
| 30 | 30 |
| 31 #include <limits> | |
| 32 | |
| 33 #include "utils.h" | 31 #include "utils.h" |
| 34 | 32 |
| 35 namespace v8 { | 33 namespace v8 { |
| 36 namespace internal { | 34 namespace internal { |
| 37 | 35 |
| 38 class UnicodeCache; | 36 class UnicodeCache; |
| 39 | 37 |
| 40 // Maximum number of significant digits in decimal representation. | 38 // Maximum number of significant digits in decimal representation. |
| 41 // The longest possible double in decimal representation is | 39 // The longest possible double in decimal representation is |
| 42 // (2^53 - 1) * 2 ^ -1074 that is (2 ^ 53 - 1) * 5 ^ 1074 / 10 ^ 1074 | 40 // (2^53 - 1) * 2 ^ -1074 that is (2 ^ 53 - 1) * 5 ^ 1074 / 10 ^ 1074 |
| (...skipping 98 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 141 // Additional number to string conversions for the number type. | 139 // Additional number to string conversions for the number type. |
| 142 // The caller is responsible for calling free on the returned pointer. | 140 // The caller is responsible for calling free on the returned pointer. |
| 143 char* DoubleToFixedCString(double value, int f); | 141 char* DoubleToFixedCString(double value, int f); |
| 144 char* DoubleToExponentialCString(double value, int f); | 142 char* DoubleToExponentialCString(double value, int f); |
| 145 char* DoubleToPrecisionCString(double value, int f); | 143 char* DoubleToPrecisionCString(double value, int f); |
| 146 char* DoubleToRadixCString(double value, int radix); | 144 char* DoubleToRadixCString(double value, int radix); |
| 147 | 145 |
| 148 } } // namespace v8::internal | 146 } } // namespace v8::internal |
| 149 | 147 |
| 150 #endif // V8_CONVERSIONS_H_ | 148 #endif // V8_CONVERSIONS_H_ |
| OLD | NEW |