- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 13 for Shuffle (0.26 sec)
-
cmd/erasure-metadata-utils.go
return shuffledPartsMetadata } // shuffleDisks - shuffle input disks slice depending on the // erasure distribution. Return shuffled slice of disks with // their expected distribution. func shuffleDisks(disks []StorageAPI, distribution []int) (shuffledDisks []StorageAPI) { if distribution == nil { return disks } shuffledDisks = make([]StorageAPI, len(disks)) // Shuffle disks for expected distribution.
Go - Registered: Sun May 05 19:28:20 GMT 2024 - Last Modified: Tue Apr 23 17:15:52 GMT 2024 - 11.3K bytes - Viewed (0) -
guava-tests/test/com/google/common/collect/MinMaxPriorityQueueTest.java
for (int attempts = 0; attempts < reduceIterationsIfGwt(1000); attempts++) { ArrayList<Integer> elements = createOrderedList(10); Collections.shuffle(elements, random); MinMaxPriorityQueue<Integer> queue = MinMaxPriorityQueue.create(elements); Collections.shuffle(elements, random); for (Integer element : elements) { assertThat(queue.remove(element)).isTrue(); assertIntact(queue);
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Thu Mar 07 18:34:03 GMT 2024 - 36.1K bytes - Viewed (0) -
cmd/xl-storage-format-v2_test.go
} buf = xlMetaV2TrimData(buf) vers = append(vers, metaCacheEntry{ name: "a", metadata: buf, }) } // Shuffle... for i := 0; i < 100; i++ { rng := rand.New(rand.NewSource(int64(i))) rng.Shuffle(len(vers), func(i, j int) { vers[i], vers[j] = vers[j], vers[i] }) var entries []chan metaCacheEntry for _, v := range vers { v.cached = nil
Go - Registered: Sun May 05 19:28:20 GMT 2024 - Last Modified: Fri Mar 08 17:50:48 GMT 2024 - 36.4K 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
Plain Text - Registered: Wed May 08 22:53:08 GMT 2024 - Last Modified: Mon Mar 11 18:43:24 GMT 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
Plain Text - Registered: Wed May 08 22:53:08 GMT 2024 - Last Modified: Mon Mar 11 18:43:24 GMT 2024 - 19.5K 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
Plain Text - Registered: Wed May 08 22:53:08 GMT 2024 - Last Modified: Mon Mar 11 18:43:24 GMT 2024 - 19.4K 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
Plain Text - Registered: Wed May 08 22:53:08 GMT 2024 - Last Modified: Mon Mar 11 18:43:24 GMT 2024 - 19.4K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/collect/MinMaxPriorityQueueTest.java
for (int attempts = 0; attempts < reduceIterationsIfGwt(1000); attempts++) { ArrayList<Integer> elements = createOrderedList(10); Collections.shuffle(elements, random); MinMaxPriorityQueue<Integer> queue = MinMaxPriorityQueue.create(elements); Collections.shuffle(elements, random); for (Integer element : elements) { assertThat(queue.remove(element)).isTrue(); assertIntact(queue);
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Thu Mar 07 18:34:03 GMT 2024 - 36.1K bytes - Viewed (0) -
cmd/global-heal.go
if len(disks) < er.setDriveCount/2 { return fmt.Errorf("not enough drives (found=%d, healing=%d, total=%d) are available to heal `%s`", len(disks), healing, er.setDriveCount, tracker.disk.String()) } rand.Shuffle(len(disks), func(i, j int) { disks[i], disks[j] = disks[j], disks[i] }) expectedDisks := len(disks)/2 + 1 fallbackDisks := disks[expectedDisks:] disks = disks[:expectedDisks]
Go - Registered: Sun May 05 19:28:20 GMT 2024 - Last Modified: Fri Apr 26 06:32:14 GMT 2024 - 15K bytes - Viewed (1) -
guava-tests/benchmark/com/google/common/base/EnumsBenchmark.java
misses.add("INVALID"); } List<String> sampleDataList = new ArrayList<>(); sampleDataList.addAll(hits); sampleDataList.addAll(misses); Collections.shuffle(sampleDataList); sampleData = sampleDataList.toArray(new String[sampleDataList.size()]); } // Since we can't pass a concrete SomeEnum.class directly, we need to use a raw type. @SuppressWarnings("unchecked")
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Thu Feb 22 17:15:24 GMT 2024 - 29.4K bytes - Viewed (0)