- Sort Score
- Result 10 results
- Languages All
Results 41 - 50 of 1,559 for log2 (0.05 sec)
-
src/runtime/memclr_arm64.s
MOVW block_size<>(SB), R5 TBNZ $31, R5, no_zva CBNZ R5, zero_by_line // DCZID_EL0 bit assignments // [63:5] Reserved // [4] DZP, if bit set DC ZVA instruction is prohibited, else permitted // [3:0] log2 of the block size in words, eg. if it returns 0x4 then block size is 16 words MRS DCZID_EL0, R3 TBZ $4, R3, init // ZVA not available MOVW $~0, R5 MOVW R5, block_size<>(SB) B no_zva init:
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Mar 18 18:26:13 UTC 2022 - 3.6K bytes - Viewed (0) -
platforms/core-runtime/logging/src/integTest/groovy/org/gradle/internal/logging/console/taskgrouping/AbstractBasicGroupedTaskLoggingFunctionalTest.groovy
new java.net.URL("${server.uri}/log" + projectName).openConnection().getContentLength() logger.quiet "Done with " + projectName logger.error "Done with " + projectName } } } """ when: server.expectConcurrent("log1", "log2", "log3") executer.withArgument("--parallel")
Registered: Wed Jun 12 18:38:38 UTC 2024 - Last Modified: Tue Oct 24 06:54:47 UTC 2023 - 8.2K bytes - Viewed (0) -
android/guava/src/com/google/common/math/DoubleUtils.java
// This is an extremely fast implementation of BigInteger.doubleValue(). JDK patch pending. BigInteger absX = x.abs(); int exponent = absX.bitLength() - 1; // exponent == floor(log2(abs(x))) if (exponent < Long.SIZE - 1) { return x.longValue(); } else if (exponent > MAX_EXPONENT) { return x.signum() * POSITIVE_INFINITY; } /*
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Wed Apr 28 15:37:52 UTC 2021 - 5.1K bytes - Viewed (0) -
staging/src/k8s.io/apiserver/pkg/util/shufflesharding/shufflesharding.go
// to a hand of the given size. The result is meaningful only if // 1 <= handSize <= deckSize <= 1<<26. func RequiredEntropyBits(deckSize, handSize int) int { return int(math.Ceil(math.Log2(float64(deckSize)) * float64(handSize))) } // Dealer contains some necessary parameters and provides some methods for shuffle sharding. // Dealer is thread-safe. type Dealer struct { deckSize int handSize int }
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Wed Oct 23 08:38:03 UTC 2019 - 4K bytes - Viewed (0) -
guava/src/com/google/common/math/DoubleUtils.java
// This is an extremely fast implementation of BigInteger.doubleValue(). JDK patch pending. BigInteger absX = x.abs(); int exponent = absX.bitLength() - 1; // exponent == floor(log2(abs(x))) if (exponent < Long.SIZE - 1) { return x.longValue(); } else if (exponent > MAX_EXPONENT) { return x.signum() * POSITIVE_INFINITY; } /*
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Wed Apr 28 15:37:52 UTC 2021 - 5.1K bytes - Viewed (0) -
src/math/big/example_test.go
// an initial estimate for sqrt(2), and then iterate: // x_{n+1} = 1/2 * ( x_n + (2.0 / x_n) ) // Since Newton's Method doubles the number of correct digits at each // iteration, we need at least log_2(prec) steps. steps := int(math.Log2(prec)) // Initialize values we need for the computation. two := new(big.Float).SetPrec(prec).SetInt64(2) half := new(big.Float).SetPrec(prec).SetFloat64(0.5)
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed Aug 26 16:15:32 UTC 2020 - 4K bytes - Viewed (0) -
src/math/all_test.go
for i := 0; i < len(vf); i++ { a := Abs(vf[i]) if f := Log2(a); !veryclose(log2[i], f) { t.Errorf("Log2(%g) = %g, want %g", a, f, log2[i]) } } if f := Log2(E); f != Log2E { t.Errorf("Log2(%g) = %g, want %g", E, f, Log2E) } for i := 0; i < len(vflogSC); i++ { if f := Log2(vflogSC[i]); !alike(logSC[i], f) { t.Errorf("Log2(%g) = %g, want %g", vflogSC[i], f, logSC[i]) } }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Jul 07 17:39:26 UTC 2023 - 86.8K bytes - Viewed (0) -
staging/src/k8s.io/apiserver/pkg/util/shufflesharding/shufflesharding_test.go
return ans } func TestUniformDistribution(t *testing.T) { const spare = 64 - MaxHashBits tests := []struct { deckSize, handSize int hashMax int }{ {64, 3, 1 << uint(math.Ceil(math.Log2(float64(ff(64, 3))))+spare)}, {128, 3, ff(128, 3)}, {50, 4, ff(50, 4)}, } for _, test := range tests { dealer, err := NewDealer(test.deckSize, test.handSize) if err != nil {
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Mon Jan 25 06:44:08 UTC 2021 - 6.7K bytes - Viewed (0) -
src/internal/trace/summary_test.go
} } // Check logs. if len(want.logs) != len(summary.Logs) { t.Errorf("wanted %d logs for task %d, got %d logs instead", len(want.logs), id, len(summary.Logs)) } else { for i := range want.logs { if want.logs[i] != summary.Logs[i].Log() { t.Errorf("log mismatch: want %#v, got %#v", want.logs[i], summary.Logs[i].Log()) } } } // Check goroutines.
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri May 17 18:48:18 UTC 2024 - 13.4K bytes - Viewed (0) -
src/runtime/traceallocfree.go
func traceGoroutineStackID(base uintptr) traceArg { return traceArg(uint64(base)-trace.minPageHeapAddr) / fixedStack } // traceCompressStackSize assumes size is a power of 2 and returns log2(size). func traceCompressStackSize(size uintptr) traceArg { if size&(size-1) != 0 { throw("goroutine stack size is not a power of 2") } return traceArg(sys.Len64(uint64(size)))
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed May 22 20:32:51 UTC 2024 - 5.9K bytes - Viewed (0)