- Sort Score
- Result 10 results
- Languages All
Results 51 - 60 of 111 for SHUFFLE (0.14 sec)
-
pkg/kubelet/clustertrustbundle/clustertrustbundle_manager.go
} trustAnchorSet = trustAnchorSet.Insert(string(b.Bytes)) } } // Give the list a stable ordering that changes each time Kubelet restarts. trustAnchorList := sets.List(trustAnchorSet) rand.Shuffle(len(trustAnchorList), func(i, j int) { trustAnchorList[i], trustAnchorList[j] = trustAnchorList[j], trustAnchorList[i] }) pemTrustAnchors := []byte{} for _, ta := range trustAnchorList { b := &pem.Block{
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Fri Nov 03 18:40:48 UTC 2023 - 8.3K bytes - Viewed (0) -
platforms/software/dependency-management/src/test/groovy/org/gradle/api/internal/catalog/ProjectAccessorsSourceGeneratorTest.groovy
spec.resolveStrategy = Closure.DELEGATE_FIRST spec() children.add(childBuilder) } ProjectDescriptor build() { children.shuffle() def childDescriptors = children*.build() as Set<TestProjectDescriptor> def thisProject = new TestProjectDescriptor() thisProject.name = name
Registered: Wed Jun 12 18:38:38 UTC 2024 - Last Modified: Tue Oct 10 21:10:11 UTC 2023 - 12.3K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/math/QuantilesTest.java
indexes.add(index); expectedBuilder.put(index, expectedLargeDatasetPercentile(index)); } Random random = new Random(770683168895677741L); Collections.shuffle(indexes, random); assertThat(percentiles().indexes(Ints.toArray(indexes)).compute(PSEUDORANDOM_DATASET)) .comparingValuesUsing(QUANTILE_CORRESPONDENCE) .containsExactlyEntriesIn(expectedBuilder.buildOrThrow());
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Wed Sep 06 17:04:31 UTC 2023 - 29.7K bytes - Viewed (0) -
test/fibo.go
f0, f1, f2 = f1, f2, f0 } } else { for i := 1; i < n; i++ { f2 := nat(nil).add(f1, f0) // allocate a new f2 each time f0, f1 = f1, f2 } } } return f1 // was f2 before shuffle } var tests = []struct { n int want string }{ {0, "0"}, {1, "1"}, {2, "1"}, {3, "2"}, {4, "3"}, {5, "5"}, {6, "8"}, {7, "13"}, {8, "21"}, {9, "34"},
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Dec 08 22:22:58 UTC 2014 - 6.3K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/util/concurrent/AbstractFutureTest.java
return null; } }); } assertEquals(allTasks.size() + 1, barrier.getParties()); for (int i = 0; i < 1000; i++) { Collections.shuffle(allTasks); final AbstractFuture<String> future = new AbstractFuture<String>() {}; currentFuture.set(future); for (Callable<?> task : allTasks) {
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Tue Jun 11 16:13:05 UTC 2024 - 46.7K bytes - Viewed (0) -
common-protos/k8s.io/api/flowcontrol/v1beta1/generated.proto
// +optional optional int32 queues = 1; // `handSize` is a small positive number that configures the // shuffle sharding of requests into queues. When enqueuing a request // at this priority level the request's flow identifier (a string // pair) is hashed and the hash value is used to shuffle the list // of queues and deal a hand of the size specified here. The
Registered: Fri Jun 14 15:00:06 UTC 2024 - Last Modified: Mon Mar 11 18:43:24 UTC 2024 - 19.4K bytes - Viewed (0) -
common-protos/k8s.io/api/flowcontrol/v1beta3/generated.proto
// +optional optional int32 queues = 1; // `handSize` is a small positive number that configures the // shuffle sharding of requests into queues. When enqueuing a request // at this priority level the request's flow identifier (a string // pair) is hashed and the hash value is used to shuffle the list // of queues and deal a hand of the size specified here. The
Registered: Fri Jun 14 15:00:06 UTC 2024 - Last Modified: Mon Mar 11 18:43:24 UTC 2024 - 19.5K bytes - Viewed (0) -
common-protos/k8s.io/api/flowcontrol/v1alpha1/generated.proto
// +optional optional int32 queues = 1; // `handSize` is a small positive number that configures the // shuffle sharding of requests into queues. When enqueuing a request // at this priority level the request's flow identifier (a string // pair) is hashed and the hash value is used to shuffle the list // of queues and deal a hand of the size specified here. The
Registered: Fri Jun 14 15:00:06 UTC 2024 - Last Modified: Mon Mar 11 18:43:24 UTC 2024 - 19.4K bytes - Viewed (0) -
common-protos/k8s.io/api/flowcontrol/v1beta2/generated.proto
// +optional optional int32 queues = 1; // `handSize` is a small positive number that configures the // shuffle sharding of requests into queues. When enqueuing a request // at this priority level the request's flow identifier (a string // pair) is hashed and the hash value is used to shuffle the list // of queues and deal a hand of the size specified here. The
Registered: Fri Jun 14 15:00:06 UTC 2024 - Last Modified: Mon Mar 11 18:43:24 UTC 2024 - 19.4K bytes - Viewed (0) -
guava-tests/test/com/google/common/util/concurrent/AbstractFutureTest.java
return null; } }); } assertEquals(allTasks.size() + 1, barrier.getParties()); for (int i = 0; i < 1000; i++) { Collections.shuffle(allTasks); final AbstractFuture<String> future = new AbstractFuture<String>() {}; currentFuture.set(future); for (Callable<?> task : allTasks) {
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Tue Jun 11 16:13:05 UTC 2024 - 46.7K bytes - Viewed (0)