- Sort Score
- Result 10 results
- Languages All
Results 21 - 30 of 1,835 for iterations (0.23 sec)
-
src/slices/sort_benchmark_test.go
} } cmpFunc := func(a, b *myStruct) int { if n := strings.Compare(a.a, b.a); n != 0 { return n } return cmp.Compare(a.n, b.n) } // Presort the slice so all benchmark iterations are identical. slices.SortFunc(structs, cmpFunc) b.ResetTimer() for i := 0; i < b.N; i++ { // Sort the slice twice because slices.SortFunc modifies the slice in place.
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Apr 04 23:39:07 UTC 2024 - 2.1K bytes - Viewed (0) -
testing/internal-integ-testing/src/main/groovy/org/gradle/integtests/fixtures/ToBeFixedForConfigurationCache.java
*/ String[] bottomSpecs() default {}; /** * Declare regular expressions matching the iteration name. * Defaults to an empty array, meaning this annotation applies to all iterations of the annotated feature. */ String[] iterationMatchers() default {}; String because() default ""; /**
Registered: Wed Jun 12 18:38:38 UTC 2024 - Last Modified: Thu Apr 04 07:21:38 UTC 2024 - 2.7K bytes - Viewed (0) -
subprojects/core/src/integTest/groovy/org/gradle/api/CrossBuildScriptCachingIntegrationSpec.groovy
Registered: Wed Jun 12 18:38:38 UTC 2024 - Last Modified: Mon May 20 17:32:21 UTC 2024 - 24.2K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/TopKSelector.java
} else if (pivotNewIndex < k) { left = Math.max(pivotNewIndex, left + 1); minThresholdPosition = pivotNewIndex; } else { break; } iterations++; if (iterations >= maxIterations) { @SuppressWarnings("nullness") // safe because we pass sort() a range that contains real Ts T[] castBuffer = (T[]) buffer;
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Mon Apr 01 16:15:01 UTC 2024 - 11.2K bytes - Viewed (0) -
testing/internal-performance-testing/src/main/groovy/org/gradle/performance/annotations/RunFor.groovy
ScenarioType type() OperatingSystem[] operatingSystems() String[] testProjects() default [] /** * Declare regular expressions matching the iteration name. * Defaults to an empty string, meaning this annotation applies to all iterations of the annotated feature. */ String iterationMatcher() default ""; String comment() default ""; } enum ScenarioType { PER_COMMIT,
Registered: Wed Jun 12 18:38:38 UTC 2024 - Last Modified: Thu Apr 04 07:21:38 UTC 2024 - 6.2K bytes - Viewed (0) -
pkg/kubelet/config/config_test.go
seenSources := sets.New[string](TestSource) var wg sync.WaitGroup const iterations = 100 wg.Add(2) go func() { ctx, cancel := context.WithCancel(tCtx) defer cancel() defer wg.Done() for i := 0; i < iterations; i++ { config.Channel(ctx, strconv.Itoa(i)) } }() go func() { defer wg.Done() for i := 0; i < iterations; i++ { config.SeenAllSources(seenSources) } }()
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Tue Jun 04 06:25:43 UTC 2024 - 17.1K bytes - Viewed (0) -
src/internal/trace/testdata/testprog/cpu-profile.go
} } func cpuHogger(f func(x int) int, y *int, dur time.Duration) { // We only need to get one 100 Hz clock tick, so we've got // a large safety buffer. // But do at least 500 iterations (which should take about 100ms), // otherwise TestCPUProfileMultithreaded can fail if only one // thread is scheduled during the testing period. t0 := time.Now() accum := *y
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri May 17 18:48:18 UTC 2024 - 3.8K bytes - Viewed (0) -
src/internal/runtime/atomic/atomic_test.go
} } } func TestBitwiseContended8(t *testing.T) { // Start with every bit in array set to 0. a := make([]uint8, 16) // Iterations to try. N := 1 << 16 if testing.Short() { N = 1 << 10 } // Set and then clear every bit in the array bit-by-bit in different goroutines. done := make(chan bool) for i := 0; i < 8; i++ {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Mar 25 19:53:03 UTC 2024 - 8.5K bytes - Viewed (0) -
cmd/erasure-decode_test.go
if disk == nil { continue } writers[i] = newBitrotWriter(disk, "", "testbucket", "object", erasure.ShardFileSize(length), DefaultBitrotAlgorithm, erasure.ShardSize()) } // 10000 iterations with random offsets and lengths. iterations := 10000 // Create a test file to read from. buffer := make([]byte, blockSize, 2*blockSize)
Registered: Sun Jun 16 00:44:34 UTC 2024 - Last Modified: Tue Jan 30 20:43:25 UTC 2024 - 21.1K bytes - Viewed (0) -
src/go/types/termlist.go
// one iteration. for _, x := range xl { if x != nil { return false } } return true } // isAll reports whether the termlist xl represents the set of all types. func (xl termlist) isAll() bool { // If there's a 𝓤 term, the entire list is 𝓤. // If the termlist is in normal form, this requires at most // one iteration. for _, x := range xl {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed Apr 03 18:48:38 UTC 2024 - 3.9K bytes - Viewed (0)