- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 49 for shuffled (0.3 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.
Registered: Sun Jun 16 00:44:34 UTC 2024 - Last Modified: Fri May 24 23:05:23 UTC 2024 - 11.7K bytes - Viewed (0) -
src/sort/sort_test.go
t.Errorf("Stable wasn't stable on %d ints", n) } // already sorted data.initB() Stable(data) if !IsSorted(data) { t.Errorf("Stable shuffled sorted %d ints (order)", n) } if !data.inOrder() { t.Errorf("Stable shuffled sorted %d ints (stability)", n) } // sorted reversed for i := 0; i < len(data); i++ { data[i].a = len(data) - i } data.initB() Stable(data)
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Mar 07 19:41:04 UTC 2024 - 16.9K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/graph/AbstractStandardUndirectedGraphTest.java
.inOrder(); } /** * Populates the graph with nodes and edges in a star shape with node `1` in the middle. * * <p>Note that the edges are added in a shuffled order to properly test the effect of the * insertion order. */ private void populateTShapedGraph() { putEdge(2, 1); putEdge(1, 4); putEdge(1, 3); putEdge(1, 2); // Duplicate
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Wed Sep 06 17:04:31 UTC 2023 - 12.9K bytes - Viewed (0) -
src/compress/bzip2/bzip2.go
// first pass over the data. It's an argument here because we merge the first // pass with the Huffman decoding. // // This also implements the “single array” method from the bzip2 source code // which leaves the output, still shuffled, in the bottom 8 bits of tt with the // index of the next byte in the top 24-bits. The index of the first byte is // returned. func inverseBWT(tt []uint32, origPtr uint, c []uint) uint32 { sum := uint(0)
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Apr 26 13:32:40 UTC 2024 - 13K bytes - Viewed (0) -
src/cmd/internal/obj/sym.go
// symbols reliably. Sort by name but use a stable sort, so that // any original entries with the same name (all DWARFVAR symbols // have empty names but different relocation sets) are not shuffled. // TODO: Find a better place and optimize to only sort TOC symbols. sort.SliceStable(ctxt.Data, func(i, j int) bool { return ctxt.Data[i].Name < ctxt.Data[j].Name }) }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed May 15 14:41:10 UTC 2024 - 14.1K bytes - Viewed (0) -
platforms/ide/ide-native/src/integTest/groovy/org/gradle/ide/xcode/XcodeMultipleCppProjectIntegrationTest.groovy
Registered: Wed Jun 12 18:38:38 UTC 2024 - Last Modified: Tue Sep 26 14:49:12 UTC 2023 - 12.9K bytes - Viewed (0) -
platforms/native/language-native/src/integTest/groovy/org/gradle/language/cpp/CppLibraryPublishingIntegrationTest.groovy
implementation project(':shuffle') } } project(':shuffle') { library.baseName = 'card_shuffle' } """ app.deck.writeToProject(file('deck')) app.card.writeToProject(file('card')) app.shuffle.writeToProject(file('shuffle')) when: run('publish') then:
Registered: Wed Jun 12 18:38:38 UTC 2024 - Last Modified: Wed Jan 10 12:57:50 UTC 2024 - 39.8K bytes - Viewed (0) -
platforms/native/language-native/src/integTest/groovy/org/gradle/language/cpp/CppApplicationIntegrationTest.groovy
app.shuffle.writeToProject(file("shuffle")) app.main.writeToProject(file("app")) expect: succeeds ":app:assemble" result.assertTasksExecuted([':card', ':deck', ':shuffle'].collect { tasks(it).debug.allToLink }, tasks(':app').debug.allToInstall, ":app:assemble") sharedLibrary("deck/build/lib/main/debug/deck").assertExists()
Registered: Wed Jun 12 18:38:38 UTC 2024 - Last Modified: Wed Feb 07 19:11:01 UTC 2024 - 42.5K bytes - Viewed (0) -
src/math/rand/v2/rand.go
for i := range p { p[i] = i } r.Shuffle(len(p), func(i, j int) { p[i], p[j] = p[j], p[i] }) return p } // Shuffle pseudo-randomizes the order of elements. // n is the number of elements. Shuffle panics if n < 0. // swap swaps the elements with indexes i and j. func (r *Rand) Shuffle(n int, swap func(i, j int)) { if n < 0 { panic("invalid argument to Shuffle") }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed May 22 02:25:49 UTC 2024 - 12.8K bytes - Viewed (0) -
src/math/rand/rand.go
m[i] = m[j] m[j] = i } return m } // Shuffle pseudo-randomizes the order of elements. // n is the number of elements. Shuffle panics if n < 0. // swap swaps the elements with indexes i and j. func (r *Rand) Shuffle(n int, swap func(i, j int)) { if n < 0 { panic("invalid argument to Shuffle") } // Fisher-Yates shuffle: https://en.wikipedia.org/wiki/Fisher%E2%80%93Yates_shuffle
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed May 22 22:09:08 UTC 2024 - 16.9K bytes - Viewed (0)