OLD | NEW |
1 // Copyright 2010 the V8 project authors. All rights reserved. | 1 // Copyright 2010 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 15 matching lines...) Expand all Loading... |
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 DOUBLE_CONVERSION_FIXED_DTOA_H_ | 28 #ifndef DOUBLE_CONVERSION_FIXED_DTOA_H_ |
29 #define DOUBLE_CONVERSION_FIXED_DTOA_H_ | 29 #define DOUBLE_CONVERSION_FIXED_DTOA_H_ |
30 | 30 |
31 #include "utils.h" | 31 #include "utils.h" |
32 | 32 |
33 namespace WTF { | 33 namespace WTF { |
34 | 34 |
35 namespace double_conversion { | 35 namespace double_conversion { |
36 | 36 |
37 // Produces digits necessary to print a given number with | 37 // Produces digits necessary to print a given number with |
38 // 'fractional_count' digits after the decimal point. | 38 // 'fractional_count' digits after the decimal point. |
39 // The buffer must be big enough to hold the result plus one terminating nul
l | 39 // The buffer must be big enough to hold the result plus one terminating nul
l |
40 // character. | 40 // character. |
41 // | 41 // |
42 // The produced digits might be too short in which case the caller has to fi
ll | 42 // The produced digits might be too short in which case the caller has to fi
ll |
43 // the gaps with '0's. | 43 // the gaps with '0's. |
44 // Example: FastFixedDtoa(0.001, 5, ...) is allowed to return buffer = "1",
and | 44 // Example: FastFixedDtoa(0.001, 5, ...) is allowed to return buffer = "1",
and |
45 // decimal_point = -2. | 45 // decimal_point = -2. |
46 // Halfway cases are rounded towards +/-Infinity (away from 0). The call | 46 // Halfway cases are rounded towards +/-Infinity (away from 0). The call |
47 // FastFixedDtoa(0.15, 2, ...) thus returns buffer = "2", decimal_point = 0. | 47 // FastFixedDtoa(0.15, 2, ...) thus returns buffer = "2", decimal_point = 0. |
48 // The returned buffer may contain digits that would be truncated from the | 48 // The returned buffer may contain digits that would be truncated from the |
49 // shortest representation of the input. | 49 // shortest representation of the input. |
50 // | 50 // |
51 // This method only works for some parameters. If it can't handle the input
it | 51 // This method only works for some parameters. If it can't handle the input
it |
52 // returns false. The output is null-terminated when the function succeeds. | 52 // returns false. The output is null-terminated when the function succeeds. |
53 bool FastFixedDtoa(double v, int fractional_count, | 53 bool FastFixedDtoa(double v, int fractional_count, |
54 Vector<char> buffer, int* length, int* decimal_point); | 54 Vector<char> buffer, int* length, int* decimal_point); |
55 | 55 |
56 } // namespace double_conversion | 56 } // namespace double_conversion |
57 | 57 |
58 } // namespace WTF | 58 } // namespace WTF |
59 | 59 |
60 #endif // DOUBLE_CONVERSION_FIXED_DTOA_H_ | 60 #endif // DOUBLE_CONVERSION_FIXED_DTOA_H_ |
OLD | NEW |