- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 278 for speaking (0.12 sec)
-
src/math/rand/v2/auto_test.go
// order in the deterministic seeded result. var out []int64 for i := 0; i < 10; i++ { out = append(out, Int64()) } // Look for out in seeded output. // Strictly speaking, we should look for them in order, // but this is good enough and not significantly more // likely to have a false positive. r := New(NewPCG(1, 0)) found := 0 for i := 0; i < 1000; i++ { x := r.Int64()
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Oct 30 17:09:26 UTC 2023 - 1.1K bytes - Viewed (0) -
subprojects/core/src/integTest/groovy/org/gradle/execution/taskgraph/RuleTaskBridgingIntegrationTest.groovy
Registered: Wed Jun 12 18:38:38 UTC 2024 - Last Modified: Mon May 20 12:57:53 UTC 2024 - 19.2K bytes - Viewed (0) -
platforms/software/dependency-management/src/main/java/org/gradle/api/internal/artifacts/ivyservice/ivyresolve/StartParameterResolutionOverride.java
} } private File computeReportDirectory(BuildCommencedTimeProvider timeProvider) { // TODO: This is not quite correct: we're using the "root project" build directory // but technically speaking, this can be changed _after_ this service is created. // There's currently no good way to figure that out. File buildDir = new File(gradleDir.getParentFile(), "build");
Registered: Wed Jun 12 18:38:38 UTC 2024 - Last Modified: Wed May 15 00:21:07 UTC 2024 - 11.4K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/CompactLinkedHashMap.java
* load on the garbage collector by only using a constant number of internal objects. * * <p>This class should not be assumed to be universally superior to {@code * java.util.LinkedHashMap}. Generally speaking, this class reduces object allocation and memory * consumption at the price of moderately increased constant factors of CPU. Only use this class * when there is a specific reason to prioritize memory over CPU. *
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Mon Apr 01 16:15:01 UTC 2024 - 8.5K bytes - Viewed (0) -
cmd/speedtest.go
totalGet += result.Downloads } if totalGet < throughputHighestGet { // Following check is for situations // when Writes() scale higher than Reads() // - practically speaking this never happens // and should never happen - however it has // been seen recently due to hardware issues // causes Reads() to go slower than Writes(). // // Send such results anyways as this shall
Registered: Sun Jun 16 00:44:34 UTC 2024 - Last Modified: Mon May 06 09:45:10 UTC 2024 - 9.2K bytes - Viewed (0) -
src/net/resolverdialfunc_test.go
// Use of this source code is governed by a BSD-style // license that can be found in the LICENSE file. // Test that Resolver.Dial can be a func returning an in-memory net.Conn // speaking DNS. package net import ( "bytes" "context" "errors" "fmt" "reflect" "slices" "testing" "time" "golang.org/x/net/dns/dnsmessage" )
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu May 23 01:00:11 UTC 2024 - 8.3K bytes - Viewed (0) -
guava/src/com/google/common/collect/CompactLinkedHashSet.java
* {@code java.util.LinkedHashSet}, it offers insertion-order iteration, with identical behavior. * * <p>This class should not be assumed to be universally superior to {@code * java.util.LinkedHashSet}. Generally speaking, this class reduces object allocation and memory * consumption at the price of moderately increased constant factors of CPU. Only use this class * when there is a specific reason to prioritize memory over CPU. *
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Mon Feb 05 21:38:59 UTC 2024 - 9.7K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/CompactLinkedHashSet.java
* {@code java.util.LinkedHashSet}, it offers insertion-order iteration, with identical behavior. * * <p>This class should not be assumed to be universally superior to {@code * java.util.LinkedHashSet}. Generally speaking, this class reduces object allocation and memory * consumption at the price of moderately increased constant factors of CPU. Only use this class * when there is a specific reason to prioritize memory over CPU. *
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Mon Feb 05 21:38:59 UTC 2024 - 9.5K bytes - Viewed (0) -
src/image/color/color.go
// // > For unsigned integer values, the operations +, -, *, and << are // > computed modulo 2n, where n is the bit width of the unsigned // > integer's type. Loosely speaking, these unsigned integer operations // > discard high bits upon overflow, and programs may rely on ``wrap // > around''. // // Considering these properties and the fact that this function is
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Oct 19 12:02:45 UTC 2023 - 8.3K bytes - Viewed (0) -
guava/src/com/google/common/collect/CompactLinkedHashMap.java
* load on the garbage collector by only using a constant number of internal objects. * * <p>This class should not be assumed to be universally superior to {@code * java.util.LinkedHashMap}. Generally speaking, this class reduces object allocation and memory * consumption at the price of moderately increased constant factors of CPU. Only use this class * when there is a specific reason to prioritize memory over CPU. *
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Mon Apr 01 16:15:01 UTC 2024 - 10.2K bytes - Viewed (0)