1 | // © 2018 and later: Unicode, Inc. and others. |
2 | // License & terms of use: http://www.unicode.org/copyright.html |
3 | // |
4 | // From the double-conversion library. Original license: |
5 | // |
6 | // Copyright 2010 the V8 project authors. All rights reserved. |
7 | // Redistribution and use in source and binary forms, with or without |
8 | // modification, are permitted provided that the following conditions are |
9 | // met: |
10 | // |
11 | // * Redistributions of source code must retain the above copyright |
12 | // notice, this list of conditions and the following disclaimer. |
13 | // * Redistributions in binary form must reproduce the above |
14 | // copyright notice, this list of conditions and the following |
15 | // disclaimer in the documentation and/or other materials provided |
16 | // with the distribution. |
17 | // * Neither the name of Google Inc. nor the names of its |
18 | // contributors may be used to endorse or promote products derived |
19 | // from this software without specific prior written permission. |
20 | // |
21 | // THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS |
22 | // "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT |
23 | // LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR |
24 | // A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT |
25 | // OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, |
26 | // SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT |
27 | // LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, |
28 | // DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY |
29 | // THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT |
30 | // (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE |
31 | // OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
32 | |
33 | // ICU PATCH: ifdef around UCONFIG_NO_FORMATTING |
34 | #include "unicode/utypes.h" |
35 | #if !UCONFIG_NO_FORMATTING |
36 | |
37 | #ifndef DOUBLE_CONVERSION_CACHED_POWERS_H_ |
38 | #define DOUBLE_CONVERSION_CACHED_POWERS_H_ |
39 | |
40 | // ICU PATCH: Customize header file paths for ICU. |
41 | |
42 | #include "double-conversion-diy-fp.h" |
43 | |
44 | // ICU PATCH: Wrap in ICU namespace |
45 | U_NAMESPACE_BEGIN |
46 | |
47 | namespace double_conversion { |
48 | |
49 | namespace PowersOfTenCache { |
50 | |
51 | // Not all powers of ten are cached. The decimal exponent of two neighboring |
52 | // cached numbers will differ by kDecimalExponentDistance. |
53 | static const int kDecimalExponentDistance = 8; |
54 | |
55 | static const int kMinDecimalExponent = -348; |
56 | static const int kMaxDecimalExponent = 340; |
57 | |
58 | // Returns a cached power-of-ten with a binary exponent in the range |
59 | // [min_exponent; max_exponent] (boundaries included). |
60 | void GetCachedPowerForBinaryExponentRange(int min_exponent, |
61 | int max_exponent, |
62 | DiyFp* power, |
63 | int* decimal_exponent); |
64 | |
65 | // Returns a cached power of ten x ~= 10^k such that |
66 | // k <= decimal_exponent < k + kCachedPowersDecimalDistance. |
67 | // The given decimal_exponent must satisfy |
68 | // kMinDecimalExponent <= requested_exponent, and |
69 | // requested_exponent < kMaxDecimalExponent + kDecimalExponentDistance. |
70 | void GetCachedPowerForDecimalExponent(int requested_exponent, |
71 | DiyFp* power, |
72 | int* found_exponent); |
73 | |
74 | } // namespace PowersOfTenCache |
75 | |
76 | } // namespace double_conversion |
77 | |
78 | // ICU PATCH: Close ICU namespace |
79 | U_NAMESPACE_END |
80 | |
81 | #endif // DOUBLE_CONVERSION_CACHED_POWERS_H_ |
82 | #endif // ICU PATCH: close #if !UCONFIG_NO_FORMATTING |
83 | |