- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 125 for shuffled (0.21 sec)
-
tensorflow/compiler/mlir/tensorflow/ir/tf_ops_layout_helper.cc
SmallVector<Attribute, 8> shuffled(values.size()); for (size_t i = 0; i < permutation.size(); ++i) { for (size_t j = 0; j < inner_size; ++j) { shuffled[i * inner_size + j] = values[permutation[i] * inner_size + j]; } } return ArrayAttr::get(attr.getContext(), shuffled); } // Shuffle ranked tensor dimensions according to the permutation.
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Thu Apr 25 16:01:03 UTC 2024 - 3.3K bytes - Viewed (0) -
src/cmd/compile/internal/types/sym_test.go
abc.Lookup("b"), xyz.Lookup("b"), uvw.Lookup("c"), gr.Lookup("φ"), } if len(data) != len(want) { t.Fatal("want and data must match") } if reflect.DeepEqual(data, want) { t.Fatal("data must be shuffled") } sort.Slice(data, func(i, j int) bool { return data[i].Less(data[j]) }) if !reflect.DeepEqual(data, want) { t.Logf("want: %#v", want) t.Logf("data: %#v", data) t.Errorf("sorting failed") }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu May 02 20:30:31 UTC 2019 - 1.2K bytes - Viewed (0) -
platforms/core-configuration/kotlin-dsl/src/test/kotlin/org/gradle/kotlin/dsl/accessors/PluginTreeTest.kt
PluginTree.PluginSpec("flat-plugin.conflict", "IgnoredPlugin"), PluginTree.PluginSpec("nested.plugin-a.conflict", "IgnoredPlugin") ).shuffled().asSequence() ), equalTo<Map<String, PluginTree>>( linkedMapOf( flatPlugin.id to flatPlugin, "nested" to PluginTree.PluginGroup(
Registered: Wed Jun 12 18:38:38 UTC 2024 - Last Modified: Wed Aug 02 08:06:49 UTC 2023 - 2.5K bytes - Viewed (0) -
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) -
staging/src/k8s.io/apiserver/pkg/util/shufflesharding/shufflesharding.go
// If we use all bits of hash value, the critical(last) card shuffled by // Dealer will be uneven to 2:3 (first half:second half) at most, // in order to reduce this unevenness to 32:33, we set MaxHashBits to 60 here. const MaxHashBits = 60 // RequiredEntropyBits makes a quick and slightly conservative estimate of the number // of bits of hash value that are consumed in shuffle sharding a deck of the given size
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Wed Oct 23 08:38:03 UTC 2019 - 4K bytes - Viewed (0) -
src/cmd/go/testdata/script/test_shuffle.txt
go test -c exec ./m.test -test.shuffle=off ! stdout '^-test.shuffle ' exec ./m.test -test.shuffle=on stdout '^-test.shuffle ' exec ./m.test -test.v -test.bench=. -test.shuffle=0 foo_test.go stdout '^-test.shuffle 0' stdout '(?s)TestTwo(.*)TestOne(.*)TestThree(.*)BenchmarkThree(.*)BenchmarkOne(.*)BenchmarkTwo' exec ./m.test -test.v -test.bench=. -test.shuffle=123 foo_test.go stdout '^-test.shuffle 123'
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Jan 19 20:46:11 UTC 2023 - 4.7K bytes - Viewed (0) -
src/slices/sort_test.go
} // already sorted data.initB() SortStableFunc(data, intPairCmp) if !IsSortedFunc(data, intPairCmp) { t.Errorf("Stable shuffled sorted %d ints (order)", n) } if !data.inOrder(false) { 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()
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu May 09 19:20:55 UTC 2024 - 9.5K bytes - Viewed (0) -
tensorflow/compiler/mlir/tensorflow/tests/layout_optimization_to_nhwc.mlir
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Mon Oct 30 06:52:55 UTC 2023 - 7.3K 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) -
cmd/erasure-metadata-utils_test.go
if err != nil { removeRoots(disks) t.Fatal(err) } defer removeRoots(disks) z := objLayer.(*erasureServerPools) testShuffleDisks(t, z) } // Test shuffleDisks which returns shuffled slice of disks for their actual distribution. func testShuffleDisks(t *testing.T, z *erasureServerPools) { disks := z.serverPools[0].GetDisks(0)() distribution := []int{16, 14, 12, 10, 8, 6, 4, 2, 1, 3, 5, 7, 9, 11, 13, 15}
Registered: Sun Jun 16 00:44:34 UTC 2024 - Last Modified: Thu Jan 18 07:03:17 UTC 2024 - 7.4K bytes - Viewed (0)