| /third_party/musl/libc-test/src/functionalext/supplement/math/ |
| H A D | functionalext_pow10.c | 27 double ret0 = pow10(0); in pow10_0100()
29 double ret1 = pow10(1); in pow10_0100()
31 double ret2 = pow10(2); in pow10_0100()
33 double ret3 = pow10(3); in pow10_0100()
35 double ret4 = pow10(4); in pow10_0100()
37 double ret5 = pow10(5); in pow10_0100()
39 double ret6 = pow10(6); in pow10_0100()
41 double ret7 = pow10(7); in pow10_0100()
43 double ret8 = pow10(8); in pow10_0100()
45 double ret9 = pow10( in pow10_0100()
[all...] |
| /third_party/libphonenumber/metadata/src/main/java/com/google/i18n/phonenumbers/metadata/ |
| H A D | DigitSequence.java | 98 private static long pow10(int n) { in pow10() method in DigitSequence
118 if (next < pow10(num.length)) { in next()
133 return (len >= 0) ? new DigitSequence(len, pow10(len) - 1) : null; in previous()
191 return new DigitSequence(length, pow10(length) - 1); in nines()
205 // Don't check for -ve length as this should never happen and will blow up in pow10() anyway. in DigitSequence()
209 Preconditions.checkArgument(value >= 0 && value < pow10(length)); in DigitSequence()
230 return (int) (value / pow10(((length - 1) - n)) % 10); in getDigit()
239 return new DigitSequence(n, value / pow10(length - n)); in first()
248 return new DigitSequence(n, value % pow10(n)); in last()
262 return new DigitSequence(length + n.length, (pow10( in extendBy()
[all...] |
| /third_party/json/include/nlohmann/detail/conversions/ |
| H A D | to_chars.hpp | 489 For n != 0, returns k, such that pow10 := 10^(k-1) <= n < 10^k.
490 For n == 0, returns 1 and sets pow10 := 1.
492 inline int find_largest_pow10(const std::uint32_t n, std::uint32_t& pow10) in find_largest_pow10() argument
497 pow10 = 1000000000; in find_largest_pow10()
503 pow10 = 100000000; in find_largest_pow10()
508 pow10 = 10000000; in find_largest_pow10()
513 pow10 = 1000000; in find_largest_pow10()
518 pow10 = 100000; in find_largest_pow10()
523 pow10 = 10000; in find_largest_pow10()
528 pow10 in find_largest_pow10()
[all...] |
| /third_party/skia/src/utils/ |
| H A D | SkFloatToDecimal.cpp | 33 static double pow10(int e) { in pow10() function
122 double power = pow10(-decimalShift);
130 // SkASSERT(power * 0.1 = pow10(-decimalShift));
|
| H A D | SkJSON.cpp | 272 static inline float pow10(int32_t exp) { in pow10() function
751 const auto decimal_scale = pow10(exp); in matchFastFloatDecimalPart()
828 this->pushFloat(sign * n32 * pow10(exp)); in matchFast32OrFloat()
|
| /third_party/musl/porting/liteos_a/kernel/src/math/ |
| H A D | exp10.c | 24 weak_alias(exp10, pow10);
|
| /third_party/musl/src/math/ |
| H A D | exp10.c | 24 weak_alias(exp10, pow10);
|
| /third_party/python/Modules/_decimal/tests/ |
| H A D | randdec.py | 157 pow10 = [10**n for n in lst]
163 for coeff in pow10:
174 pow10 = [10**n for n in lst]
184 for coeff in pow10:
|
| /third_party/musl/libc-test/src/math/ |
| H A D | pow10.c | 7 #include "sanity/pow10.h"
27 y = pow10(p->x); in main()
31 printf("%s:%d: bad fp exception: %s pow10(%a)=%a, want %s", in main()
38 printf("%s:%d: %s pow10(%a) want %a got %a ulperr %.3f = %a + %a\n", in main()
|
| /third_party/musl/porting/liteos_a/kernel/include/ |
| H A D | math.h | 433 double pow10(double);
|
| /third_party/musl/porting/uniproton/kernel/include/ |
| H A D | math.h | 433 double pow10(double);
|
| /third_party/musl/porting/liteos_m/kernel/include/ |
| H A D | math.h | 433 double pow10(double);
|
| /third_party/musl/include/ |
| H A D | math.h | 433 double pow10(double);
|
| /third_party/skia/third_party/externals/abseil-cpp/absl/time/ |
| H A D | duration.cc | 716 double pow10; member
744 int64_t frac_part = Round(std::modf(n, &d) * unit.pow10); in AppendNumberUnit()
|
| /third_party/musl/libc-test/src/math/gen/ |
| H A D | mplibm.c | 241 int mppow10(struct t *t) { return mpd1(t, pow10); } in mppow10()
|
| /third_party/json/tests/abi/include/nlohmann/ |
| H A D | json_v3_10_5.hpp | 15424 For n != 0, returns k, such that pow10 := 10^(k-1) <= n < 10^k.
15425 For n == 0, returns 1 and sets pow10 := 1.
15427 inline int find_largest_pow10(const std::uint32_t n, std::uint32_t& pow10)
15432 pow10 = 1000000000;
15438 pow10 = 100000000;
15443 pow10 = 10000000;
15448 pow10 = 1000000;
15453 pow10 = 100000;
15458 pow10 = 10000;
15463 pow10
[all...] |
| /third_party/json/single_include/nlohmann/ |
| H A D | json.hpp | 17272 For n != 0, returns k, such that pow10 := 10^(k-1) <= n < 10^k.
17273 For n == 0, returns 1 and sets pow10 := 1.
17275 inline int find_largest_pow10(const std::uint32_t n, std::uint32_t& pow10)
17280 pow10 = 1000000000;
17286 pow10 = 100000000;
17291 pow10 = 10000000;
17296 pow10 = 1000000;
17301 pow10 = 100000;
17306 pow10 = 10000;
17311 pow10
[all...] |
| /third_party/rust/crates/bindgen/bindgen-tests/tests/ |
| H A D | stylo.hpp | 33540 extern double pow10 (double __x) throw (); extern double __pow10 (double __x) throw ();
[all...] |