- Sort Score
- Result 10 results
- Languages All
Results 21 - 30 of 128 for shuffle (0.44 sec)
-
guava-tests/test/com/google/common/collect/CollectionBenchmarkSampleData.java
Collections.shuffle(tmp, random); queryList.addAll(tmp.subList(0, extras)); } // now add bad queries while (queryList.size() < numQueries) { Element candidate = newElement(); if (!elementsInSet.contains(candidate)) { queryList.add(candidate); } } Collections.shuffle(queryList, random); return queryList.toArray(new Element[0]);
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Mon Apr 17 15:49:06 UTC 2023 - 4.2K bytes - Viewed (0) -
docs/en/docs/js/custom.js
} return true; }); } window.addEventListener("scroll", loadVisibleTermynals); createTermynals(); loadVisibleTermynals(); } function shuffle(array) { var currentIndex = array.length, temporaryValue, randomIndex; while (0 !== currentIndex) { randomIndex = Math.floor(Math.random() * currentIndex); currentIndex -= 1;
Registered: Mon Jun 17 08:32:26 UTC 2024 - Last Modified: Sat May 08 17:50:56 UTC 2021 - 6.6K bytes - Viewed (0) -
src/math/rand/v2/rand_test.go
p := make([]int, n) // re-usable slice for Shuffle generator tests := [...]struct { name string fn func() int }{ {name: "Int32N", fn: func() int { return int(r.Int32N(int32(nfact))) }}, {name: "Perm", fn: func() int { return encodePerm(r.Perm(n)) }}, {name: "Shuffle", fn: func() int { // Generate permutation using Shuffle. for i := range p { p[i] = i }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu May 23 18:42:28 UTC 2024 - 17.4K bytes - Viewed (0) -
platforms/software/security/src/main/java/org/gradle/security/internal/PublicKeyDownloadService.java
Collections.shuffle(servers); tryDownloadKeyFromServer(toLongIdHexString(keyId), servers, builder, keyring -> findMatchingKey(keyId, keyring, builder)); } @Override public void findByFingerprint(byte[] fingerprint, PublicKeyResultBuilder builder) { List<URI> servers = new ArrayList<>(keyServers); Collections.shuffle(servers);
Registered: Wed Jun 12 18:38:38 UTC 2024 - Last Modified: Fri Apr 12 08:49:35 UTC 2024 - 6.9K bytes - Viewed (0) -
src/cmd/go/internal/test/flagdefs.go
"mutexprofile": true, "mutexprofilefraction": true, "outputdir": true, "parallel": true, "run": true, "short": true, "shuffle": true, "skip": true, "timeout": true, "trace": true, "v": true, } var passAnalyzersToVet = map[string]bool{
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri May 03 01:02:40 UTC 2024 - 2.2K bytes - Viewed (0) -
maven-model-builder/src/test/java/org/apache/maven/model/building/GraphTest.java
Registered: Wed Jun 12 09:55:16 UTC 2024 - Last Modified: Mon Jan 15 16:49:26 UTC 2024 - 2.1K bytes - Viewed (0) -
staging/src/k8s.io/apiserver/pkg/util/flowcontrol/fairqueuing/interface.go
// StartRequest begins the process of handling a request. If the // request gets queued and the number of queues is greater than 1 // then StartRequest uses the given hashValue as the source of // entropy as it shuffle-shards the request into a queue. The // descr1 and descr2 values play no role in the logic but appear // in log messages. This method always returns quickly (without // waiting for the request to be dequeued). If this method
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Tue Sep 26 12:55:23 UTC 2023 - 6.4K bytes - Viewed (0) -
guava-testlib/src/com/google/common/collect/testing/MinimalCollection.java
private final boolean allowNulls; // Package-private so that it can be extended. MinimalCollection(Class<? super @NonNull E> type, boolean allowNulls, E... contents) { // TODO: consider making it shuffle the contents to test iteration order. this.contents = Platform.clone(contents); this.type = type; this.allowNulls = allowNulls; if (!allowNulls) { for (Object element : contents) {
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Wed Feb 21 16:49:06 UTC 2024 - 3.8K bytes - Viewed (0) -
platforms/software/dependency-management/src/test/groovy/org/gradle/api/internal/artifacts/ivyservice/resolveengine/excludes/factories/ExcludeTestSupport.groovy
Registered: Wed Jun 12 18:38:38 UTC 2024 - Last Modified: Tue Oct 10 21:10:11 UTC 2023 - 4.2K bytes - Viewed (0) -
src/crypto/aes/block.go
s2 := byteorder.BeUint32(src[8:12]) s3 := byteorder.BeUint32(src[12:16]) // First round just XORs input with key. s0 ^= xk[0] s1 ^= xk[1] s2 ^= xk[2] s3 ^= xk[3] // Middle rounds shuffle using tables. // Number of rounds is set by length of expanded key. nr := len(xk)/4 - 2 // - 2: one above, one more below k := 4 var t0, t1, t2, t3 uint32 for r := 0; r < nr; r++ {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon May 13 18:57:38 UTC 2024 - 6.4K bytes - Viewed (0)