- Sort Score
- Result 10 results
- Languages All
Results 21 - 30 of 38 for Log2 (0.05 sec)
-
guava/src/com/google/common/collect/TopKSelector.java
int minThresholdPosition = 0; // The leftmost position at which the greatest of the k lower elements // -- the new value of threshold -- might be found. int iterations = 0; int maxIterations = IntMath.log2(right - left, RoundingMode.CEILING) * 3; while (left < right) { int pivotIndex = (left + right + 1) >>> 1; int pivotNewIndex = partition(left, right, pivotIndex); if (pivotNewIndex > k) {
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Mon Apr 01 16:15:01 UTC 2024 - 11.2K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/TopKSelector.java
int minThresholdPosition = 0; // The leftmost position at which the greatest of the k lower elements // -- the new value of threshold -- might be found. int iterations = 0; int maxIterations = IntMath.log2(right - left, RoundingMode.CEILING) * 3; while (left < right) { int pivotIndex = (left + right + 1) >>> 1; int pivotNewIndex = partition(left, right, pivotIndex); if (pivotNewIndex > k) {
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Mon Apr 01 16:15:01 UTC 2024 - 11.2K bytes - Viewed (0) -
src/crypto/ecdh/ecdh_test.go
k, err := curve.GenerateKey(r) if err != nil { t.Fatal(err) } // GenerateKey does rejection sampling. If the masking works correctly, // the probability of a rejection is 1-ord(G)/2^ceil(log2(ord(G))), // which for all curves is small enough (at most 2^-32, for P-256) that // a bit flip is more likely to make this test fail than bad luck. // Account for the extra MaybeReadByte byte, too.
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed Mar 27 18:23:49 UTC 2024 - 18K bytes - Viewed (0) -
src/runtime/stack.go
stackLarge.free[i].init() lockInit(&stackLarge.lock, lockRankStackLarge) } } // stacklog2 returns ⌊log_2(n)⌋. func stacklog2(n uintptr) int { log2 := 0 for n > 1 { n >>= 1 log2++ } return log2 } // Allocates a stack from the free pool. Must be called with // stackpool[order].item.mu held. func stackpoolalloc(order uint8) gclinkptr {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed May 22 22:31:00 UTC 2024 - 41.1K bytes - Viewed (0) -
src/crypto/internal/bigmod/nat.go
return x, nil } // SetOverflowingBytes assigns x = b, where b is a slice of big-endian bytes. // SetOverflowingBytes returns an error if b has a longer bit length than m, but // reduces overflowing values up to 2^⌈log2(m)⌉ - 1. // // The output will be resized to the size of m and overwritten. func (x *Nat) SetOverflowingBytes(b []byte, m *Modulus) (*Nat, error) { if err := x.setBytes(b, m); err != nil { return nil, err }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon May 13 18:57:38 UTC 2024 - 24K bytes - Viewed (0) -
android/guava/src/com/google/common/io/BaseEncoding.java
import static com.google.common.base.Preconditions.checkPositionIndexes; import static com.google.common.base.Preconditions.checkState; import static com.google.common.math.IntMath.divide; import static com.google.common.math.IntMath.log2; import static java.math.RoundingMode.CEILING; import static java.math.RoundingMode.FLOOR; import static java.math.RoundingMode.UNNECESSARY; import com.google.common.annotations.GwtCompatible;
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Fri Mar 15 16:33:32 UTC 2024 - 41.7K bytes - Viewed (0) -
guava/src/com/google/common/io/BaseEncoding.java
import static com.google.common.base.Preconditions.checkPositionIndexes; import static com.google.common.base.Preconditions.checkState; import static com.google.common.math.IntMath.divide; import static com.google.common.math.IntMath.log2; import static java.math.RoundingMode.CEILING; import static java.math.RoundingMode.FLOOR; import static java.math.RoundingMode.UNNECESSARY; import com.google.common.annotations.GwtCompatible;
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Fri Mar 15 16:33:32 UTC 2024 - 41.7K bytes - Viewed (0) -
src/cmd/vendor/github.com/google/pprof/internal/graph/graph.go
} } if total != 0 { for _, e := range edges { frac := float64(abs64(e.Weight)) / float64(total) score += -frac * math.Log2(frac) } if self > 0 { frac := float64(abs64(self)) / float64(total) score += -frac * math.Log2(frac) } } return score } // NodeOrder sets the ordering for a Sort operation type NodeOrder int
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri May 31 19:48:28 UTC 2024 - 31K bytes - Viewed (0) -
guava/src/com/google/common/util/concurrent/Striped.java
return size; } } /** A bit mask were all bits are set. */ private static final int ALL_SET = ~0; private static int ceilToPowerOfTwo(int x) { return 1 << IntMath.log2(x, RoundingMode.CEILING); } /* * This method was written by Doug Lea with assistance from members of JCP JSR-166 Expert Group * and released to the public domain, as explained at
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Mon Apr 10 20:55:18 UTC 2023 - 20.3K bytes - Viewed (0) -
android/guava/src/com/google/common/util/concurrent/Striped.java
return size; } } /** A bit mask were all bits are set. */ private static final int ALL_SET = ~0; private static int ceilToPowerOfTwo(int x) { return 1 << IntMath.log2(x, RoundingMode.CEILING); } /* * This method was written by Doug Lea with assistance from members of JCP JSR-166 Expert Group * and released to the public domain, as explained at
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Mon Apr 10 20:55:18 UTC 2023 - 20.3K bytes - Viewed (0)