- Sort Score
- Result 10 results
- Languages All
Results 51 - 60 of 108 for shuffled (0.16 sec)
-
docs/bigdata/README.md
mapreduce.fileoutputcommitter.algorithm.version=2 # Use the latest committer version mapreduce.job.reduce.slowstart.completedmaps=0.99 # 99% map, then reduce mapreduce.reduce.shuffle.input.buffer.percent=0.9 # Min % buffer in RAM mapreduce.reduce.shuffle.merge.percent=0.9 # Minimum % merges in RAM mapreduce.reduce.speculative=false # Disable speculation for reducing mapreduce.task.io.sort.factor=999 # Threshold before writing to disk
Registered: Sun Jun 16 00:44:34 UTC 2024 - Last Modified: Thu Sep 29 04:28:45 UTC 2022 - 14.7K bytes - Viewed (0) -
src/testing/testing.go
m.exitCode = 0 return } if *shuffle != "off" { var n int64 var err error if *shuffle == "on" { n = time.Now().UnixNano() } else { n, err = strconv.ParseInt(*shuffle, 10, 64) if err != nil { fmt.Fprintln(os.Stderr, `testing: -shuffle should be "off", "on", or a valid integer:`, err) m.exitCode = 2 return } }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu May 23 01:00:11 UTC 2024 - 76.1K bytes - Viewed (0) -
src/net/dnsclient.go
Target string Port uint16 Priority uint16 Weight uint16 } // byPriorityWeight sorts SRV records by ascending priority and weight. type byPriorityWeight []*SRV // shuffleByWeight shuffles SRV records by weight using the algorithm // described in RFC 2782. func (addrs byPriorityWeight) shuffleByWeight() { sum := 0 for _, addr := range addrs { sum += int(addr.Weight) }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu May 23 01:16:53 UTC 2024 - 5.7K bytes - Viewed (0) -
tensorflow/compiler/mlir/tensorflow/ir/tf_generated_ops.td
``` }]; let arguments = (ins Arg<TF_Tensor, [{The tensor to be shuffled.}]>:$value, DefaultValuedOptionalAttr<I64Attr, "0">:$seed, DefaultValuedOptionalAttr<I64Attr, "0">:$seed2 ); let results = (outs Res<TF_Tensor, [{A tensor of same shape and type as `value`, shuffled along its first dimension.}]>:$output );
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Tue Jun 11 23:24:08 UTC 2024 - 793K bytes - Viewed (0) -
tensorflow/compiler/mlir/quantization/tensorflow/python/representative_dataset_test.py
] # Extend the representative dataset with np.ndarrays. repr_ds.extend([ {'tensor_key': np.random.uniform(low=-1.0, high=1.0, size=(3, 3))} for _ in range(4) ]) random.shuffle(repr_ds) with self.session() as sess: new_repr_ds = repr_dataset.replace_tensors_by_numpy_ndarrays( repr_ds, sess ) # The resulting dataset should not contain any tf.Tensors.
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Thu Jan 04 07:35:19 UTC 2024 - 11.6K bytes - Viewed (0) -
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) -
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)