- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 793 for Power (0.04 sec)
-
guava/src/com/google/common/math/IntMath.java
/** * Returns the smallest power of two greater than or equal to {@code x}. This is equivalent to * {@code checkedPow(2, log2(x, CEILING))}. * * @throws IllegalArgumentException if {@code x <= 0} * @throws ArithmeticException of the next-higher power of two is not representable as an {@code * int}, i.e. when {@code x > 2^30} * @since 20.0 */
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Wed Feb 07 17:50:39 UTC 2024 - 23.5K bytes - Viewed (0) -
android/guava/src/com/google/common/math/IntMath.java
/** * Returns the smallest power of two greater than or equal to {@code x}. This is equivalent to * {@code checkedPow(2, log2(x, CEILING))}. * * @throws IllegalArgumentException if {@code x <= 0} * @throws ArithmeticException of the next-higher power of two is not representable as an {@code * int}, i.e. when {@code x > 2^30} * @since 20.0 */
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Wed Feb 07 17:50:39 UTC 2024 - 23.5K bytes - Viewed (0) -
src/internal/zstd/testdata/1890a371.gettysburg.txt-100x.zst
altogether fitting and proper that we should do this. But, in a larger sense, we can not dedicate - we can not consecrate - we can not hallow - this ground. The brave men, living and dead, who struggled here, have consecrated it, far above our poor power to add or detract. The world will little note, nor long remember what we say here, but it can never forget what they did here. It is for us the living, rather, to be dedicated here to the unfinished work which they who fought here have thus far so...
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed Sep 27 14:35:13 UTC 2023 - 826 bytes - Viewed (0) -
android/guava/src/com/google/common/math/BigIntegerMath.java
* * @author Louis Wasserman * @since 11.0 */ @GwtCompatible(emulated = true) @ElementTypesAreNonnullByDefault public final class BigIntegerMath { /** * Returns the smallest power of two greater than or equal to {@code x}. This is equivalent to * {@code BigInteger.valueOf(2).pow(log2(x, CEILING))}. * * @throws IllegalArgumentException if {@code x <= 0} * @since 20.0 */
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Wed Feb 07 17:50:39 UTC 2024 - 18.9K bytes - Viewed (0) -
guava/src/com/google/common/math/BigIntegerMath.java
* * @author Louis Wasserman * @since 11.0 */ @GwtCompatible(emulated = true) @ElementTypesAreNonnullByDefault public final class BigIntegerMath { /** * Returns the smallest power of two greater than or equal to {@code x}. This is equivalent to * {@code BigInteger.valueOf(2).pow(log2(x, CEILING))}. * * @throws IllegalArgumentException if {@code x <= 0} * @since 20.0 */
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Wed Feb 07 17:50:39 UTC 2024 - 18.9K bytes - Viewed (0) -
src/math/cmplx/pow.go
// source listings for the gamma function and the incomplete beta // integral. // // Stephen L. Moshier // ******@****.*** // Complex power function // // DESCRIPTION: // // Raises complex A to the complex Zth power. // Definition is per AMS55 # 4.2.8, // analytically equivalent to cpow(a,z) = cexp(z clog(a)). // // ACCURACY: // // Relative error:
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Oct 19 11:59:09 UTC 2023 - 2.3K bytes - Viewed (0) -
android/guava/src/com/google/common/math/LongMath.java
/** * Returns the smallest power of two greater than or equal to {@code x}. This is equivalent to * {@code checkedPow(2, log2(x, CEILING))}. * * @throws IllegalArgumentException if {@code x <= 0} * @throws ArithmeticException of the next-higher power of two is not representable as a {@code * long}, i.e. when {@code x > 2^62} * @since 20.0 */
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Wed Feb 07 17:50:39 UTC 2024 - 44.6K bytes - Viewed (0) -
src/runtime/string.go
// prefix and at least one digit. if len(s) < 4 { return 0, false } power := 0 switch s[len(s)-3] { case 'K': power = 1 case 'M': power = 2 case 'G': power = 3 case 'T': power = 4 default: // Invalid suffix. return 0, false } m := uint64(1) for i := 0; i < power; i++ { m *= 1024 } n, ok := atoi64(s[:len(s)-3]) if !ok || n < 0 {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu May 23 01:17:26 UTC 2024 - 13.4K bytes - Viewed (0) -
src/strconv/itoa.go
// for 2 <= base <= 36. The result uses the lower-case letters 'a' to 'z' // for digit values >= 10. func FormatUint(i uint64, base int) string { if fastSmalls && i < nSmalls && base == 10 { return small(int(i)) } _, s := formatBits(nil, i, base, false, false) return s } // FormatInt returns the string representation of i in the given base, // for 2 <= base <= 36. The result uses the lower-case letters 'a' to 'z'
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Apr 04 14:21:28 UTC 2024 - 5.3K bytes - Viewed (0) -
tensorflow/compiler/mlir/quantization/stablehlo/utils/math_utils.h
#include "mlir/Support/LogicalResult.h" // from @llvm-project namespace mlir::quant::stablehlo { // Decomposes a given floating point value num into a normalized and quantized // fraction and an integral power of two. LogicalResult QuantizeMultiplier(double double_multiplier, int32_t& quantized_fraction, int32_t& shift); } // namespace mlir::quant::stablehlo
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Mon Sep 18 07:43:59 UTC 2023 - 1.3K bytes - Viewed (0)