Joshua
open source statistical hierarchical phrase-based machine translation system
|
00001 // Copyright 2010 the V8 project authors. All rights reserved. 00002 // Redistribution and use in source and binary forms, with or without 00003 // modification, are permitted provided that the following conditions are 00004 // met: 00005 // 00006 // * Redistributions of source code must retain the above copyright 00007 // notice, this list of conditions and the following disclaimer. 00008 // * Redistributions in binary form must reproduce the above 00009 // copyright notice, this list of conditions and the following 00010 // disclaimer in the documentation and/or other materials provided 00011 // with the distribution. 00012 // * Neither the name of Google Inc. nor the names of its 00013 // contributors may be used to endorse or promote products derived 00014 // from this software without specific prior written permission. 00015 // 00016 // THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS 00017 // "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT 00018 // LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR 00019 // A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT 00020 // OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, 00021 // SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT 00022 // LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, 00023 // DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY 00024 // THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT 00025 // (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE 00026 // OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. 00027 00028 #ifndef DOUBLE_CONVERSION_CACHED_POWERS_H_ 00029 #define DOUBLE_CONVERSION_CACHED_POWERS_H_ 00030 00031 #include "diy-fp.h" 00032 00033 namespace double_conversion { 00034 00035 class PowersOfTenCache { 00036 public: 00037 00038 // Not all powers of ten are cached. The decimal exponent of two neighboring 00039 // cached numbers will differ by kDecimalExponentDistance. 00040 static const int kDecimalExponentDistance; 00041 00042 static const int kMinDecimalExponent; 00043 static const int kMaxDecimalExponent; 00044 00045 // Returns a cached power-of-ten with a binary exponent in the range 00046 // [min_exponent; max_exponent] (boundaries included). 00047 static void GetCachedPowerForBinaryExponentRange(int min_exponent, 00048 int max_exponent, 00049 DiyFp* power, 00050 int* decimal_exponent); 00051 00052 // Returns a cached power of ten x ~= 10^k such that 00053 // k <= decimal_exponent < k + kCachedPowersDecimalDistance. 00054 // The given decimal_exponent must satisfy 00055 // kMinDecimalExponent <= requested_exponent, and 00056 // requested_exponent < kMaxDecimalExponent + kDecimalExponentDistance. 00057 static void GetCachedPowerForDecimalExponent(int requested_exponent, 00058 DiyFp* power, 00059 int* found_exponent); 00060 }; 00061 00062 } // namespace double_conversion 00063 00064 #endif // DOUBLE_CONVERSION_CACHED_POWERS_H_