- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 1,390 for log2 (0.05 sec)
-
android/guava-tests/test/com/google/common/math/DoubleMathTest.java
int log2 = DoubleMath.log2(d, FLOOR); assertTrue(StrictMath.pow(2.0, log2) <= d); assertTrue(StrictMath.pow(2.0, log2 + 1) > d); } } @GwtIncompatible // DoubleMath.log2(double, RoundingMode), StrictMath public void testRoundLog2Ceiling() { for (double d : POSITIVE_FINITE_DOUBLE_CANDIDATES) { int log2 = DoubleMath.log2(d, CEILING);
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Wed Feb 07 17:50:39 UTC 2024 - 28.1K bytes - Viewed (0) -
src/math/log10.go
// Log10 returns the decimal logarithm of x. // The special cases are the same as for [Log]. func Log10(x float64) float64 { if haveArchLog10 { return archLog10(x) } return log10(x) } func log10(x float64) float64 { return Log(x) * (1 / Ln10) } // Log2 returns the binary logarithm of x. // The special cases are the same as for [Log]. func Log2(x float64) float64 { if haveArchLog2 { return archLog2(x) }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Oct 19 11:59:09 UTC 2023 - 873 bytes - Viewed (0) -
guava/src/com/google/common/math/BigIntegerMath.java
// Strip off 2s from this value. int shift = Long.numberOfTrailingZeros(product); product >>= shift; // Use floor(log2(num)) + 1 to prevent overflow of multiplication. int productBits = LongMath.log2(product, FLOOR) + 1; int bits = LongMath.log2(startingNumber, FLOOR) + 1; // Check for the next power of two boundary, to save us a CLZ operation. int nextPowerOfTwo = 1 << (bits - 1);
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/runtime/mkfastlog2table.go
log.Fatalln(err) } } const fastlogNumBits = 5 func computeTable() []float64 { fastlog2Table := make([]float64, 1<<fastlogNumBits+1) for i := 0; i <= (1 << fastlogNumBits); i++ { fastlog2Table[i] = log2(1.0 + float64(i)/(1<<fastlogNumBits)) } return fastlog2Table } // log2 is a local copy of math.Log2 with an explicit float64 conversion
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Sun Jun 26 22:12:19 UTC 2022 - 3.1K bytes - Viewed (0) -
android/guava/src/com/google/common/math/BigIntegerMath.java
// Strip off 2s from this value. int shift = Long.numberOfTrailingZeros(product); product >>= shift; // Use floor(log2(num)) + 1 to prevent overflow of multiplication. int productBits = LongMath.log2(product, FLOOR) + 1; int bits = LongMath.log2(startingNumber, FLOOR) + 1; // Check for the next power of two boundary, to save us a CLZ operation. int nextPowerOfTwo = 1 << (bits - 1);
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/sort/search_test.go
t.Errorf("Find got (%v, %v), want (%v, %v)", pos, found, tt.wantPos, tt.wantFound) } }) } } // log2 computes the binary logarithm of x, rounded up to the next integer. // (log2(0) == 0, log2(1) == 0, log2(2) == 1, log2(3) == 2, etc.) func log2(x int) int { n := 0 for p := 1; p < x; p += p { // p == 2**n n++ } // p/2 < x <= p == 2**n return n }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Apr 07 14:42:13 UTC 2022 - 6.8K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/math/BigIntegerMathTest.java
} } // Relies on the correctness of log2(BigInteger, {HALF_UP,HALF_DOWN}). public void testLog2HalfEven() { for (BigInteger x : POSITIVE_BIGINTEGER_CANDIDATES) { int halfEven = BigIntegerMath.log2(x, HALF_EVEN); // Now figure out what rounding mode we should behave like (it depends if FLOOR was // odd/even). boolean floorWasEven = (BigIntegerMath.log2(x, FLOOR) & 1) == 0;
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Fri May 17 17:58:33 UTC 2024 - 27.8K bytes - Viewed (0) -
src/internal/abi/map.go
package abi // Map constants common to several packages // runtime/runtime-gdb.py:MapTypePrinter contains its own copy const ( // Maximum number of key/elem pairs a bucket can hold. MapBucketCountBits = 3 // log2 of number of elements in a bucket. MapBucketCount = 1 << MapBucketCountBits // Maximum key or elem size to keep inline (instead of mallocing per element). // Must fit in a uint8.
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Apr 22 20:09:01 UTC 2024 - 719 bytes - Viewed (0) -
android/guava-tests/test/com/google/common/math/IntMathTest.java
} } } } // Relies on the correctness of BigIntegerMath.log2 for all modes except UNNECESSARY. public void testLog2MatchesBigInteger() { for (int x : POSITIVE_INTEGER_CANDIDATES) { for (RoundingMode mode : ALL_SAFE_ROUNDING_MODES) { assertEquals(BigIntegerMath.log2(valueOf(x), mode), IntMath.log2(x, mode)); } } } // Relies on the correctness of isPowerOfTwo(int).
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Wed Feb 07 17:50:39 UTC 2024 - 24.5K bytes - Viewed (0) -
tensorflow/compiler/mlir/lite/transforms/prepare_quantize_helper.cc
#include <cmath> #include "absl/container/flat_hash_set.h" #include "tensorflow/core/framework/types.pb.h" namespace mlir { namespace TFL { double PowerOfTwoBound(double value) { return std::pow(2, std::ceil(std::log2(value))); } tensorflow::DataType GetQuantizedInferenceType(bool is_signed, int number_of_bits) { if (is_signed && number_of_bits == 8) { return tensorflow::DT_QINT8;
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Fri Feb 03 12:08:30 UTC 2023 - 1.4K bytes - Viewed (0)