- Sort Score
- Result 10 results
- Languages All
Results 71 - 80 of 256 for decreasing (0.25 sec)
-
pkg/controller/deployment/recreate.go
v1 "k8s.io/api/core/v1" "k8s.io/apimachinery/pkg/types" "k8s.io/kubernetes/pkg/controller" "k8s.io/kubernetes/pkg/controller/deployment/util" ) // rolloutRecreate implements the logic for recreating a replica set. func (dc *DeploymentController) rolloutRecreate(ctx context.Context, d *apps.Deployment, rsList []*apps.ReplicaSet, podMap map[types.UID][]*v1.Pod) error {
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Wed Oct 13 20:32:13 UTC 2021 - 4.2K bytes - Viewed (0) -
src/cmd/go/testdata/script/test_fuzz_mutator.txt
# TODO(b/181800488): remove -parallel=1, here and below. For now, when a # crash is found, all workers keep running, wasting resources and reducing # the number of executions available to the minimizer, increasing flakiness. # Test that the mutator is good enough to find several unique mutations. ! go test -fuzz=FuzzMutator -parallel=1 -fuzztime=100x mutator_test.go ! stdout '^ok' stdout FAIL
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Mar 16 16:53:11 UTC 2023 - 3.7K bytes - Viewed (0) -
tensorflow/compiler/jit/variable_info_util.h
ResourceVarsSnapshot* result); // Acquires the mutexes for all the variables in `variables` using a // deadlock-safe protocol (acquire the mutexes in increasing-address order). // // `variables` is allowed to contain instances that don't track a resource // variable (i.e. variables[i].var() can be null for some i). // // If the variable is read_only(), only acquires reader locks.
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Tue Feb 14 21:57:02 UTC 2023 - 4.3K bytes - Viewed (0) -
src/compress/flate/huffman_code.go
// The cases of 0, 1, and 2 literals are handled by special case code. // // list is an array of the literals with non-zero frequencies // and their associated frequencies. The array is in order of increasing // frequency and has as its last element a special element with frequency // MaxInt32. // // maxBits is the maximum number of bits that should be used to encode any literal. // It must be less than 16. //
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Nov 18 17:59:44 UTC 2022 - 9.7K bytes - Viewed (0) -
src/testdata/Isaac.Newton-Opticks.txt
the Sun shines through the Glass of the Window, or by shutting the Window that the Sun might shine through the Glass upon the Powder, and by such other fit Means of increasing or decreasing the Lights wherewith the Powder and Paper were illuminated, the Light wherewith the Powder is illuminated may be made stronger in such a due Proportion than the Light
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Oct 01 16:16:21 UTC 2018 - 553.9K bytes - Viewed (0) -
src/compress/bzip2/testdata/Isaac.Newton-Opticks.txt.bz2
grey Colour as the Powder had done before. But by laying the Paper where the Sun shines through the Glass of the Window, or by shutting the Window that the Sun might shine through the Glass upon the Powder, and by such other fit Means of increasing or decreasing the Lights wherewith the Powder and Paper were illuminated, the Light wherewith the Powder is illuminated may be made stronger in such a due Proportion than the Light wherewith the Paper is illuminated, that they shall both appear exactly...
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Sep 24 18:26:02 UTC 2018 - 129.4K bytes - Viewed (0) -
tensorflow/compiler/mlir/tf2xla/transforms/legalize_tf.cc
// subtract m here. This means we start with the superdiagonals and // move downwards towards the subdiagonals. So the start indices will // be decreasing.) Value d = rewriter.create<SubtractOp>(loc, b_k1, iotaM); Value neg_d = rewriter.create<NegOp>(loc, d); // diag_len_d = min(rows + min(d, 0), cols - max(d, 0))
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Tue Jun 11 20:00:43 UTC 2024 - 291.8K bytes - Viewed (0) -
tensorflow/compiler/mlir/tensorflow/ir/tf_generated_ops.td
input format is recommended for optimal behavior: if adjoint_a == false: A should be sorted in lexicographically increasing order. Use SparseReorder if you're not sure. if adjoint_a == true: A should be sorted in order of increasing dimension 1 (i.e., "column major" order instead of "row major" order). }]; let arguments = (ins
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Tue Jun 11 23:24:08 UTC 2024 - 793K bytes - Viewed (0) -
pkg/slices/slices.go
"golang.org/x/exp/constraints" ) // Equal reports whether two slices are equal: the same length and all // elements equal. If the lengths are different, Equal returns false. // Otherwise, the elements are compared in increasing index order, and the // comparison stops at the first unequal pair. // Floating point NaNs are not considered equal. func Equal[E comparable](s1, s2 []E) bool { return slices.Equal(s1, s2) }
Registered: Fri Jun 14 15:00:06 UTC 2024 - Last Modified: Wed May 15 06:28:11 UTC 2024 - 7.9K bytes - Viewed (0) -
src/go/doc/comment/wrap_test.go
t.Fatalf("wrap seq is empty") } if seq[0] != 0 { t.Fatalf("wrap seq does not start with 0") } for _, n := range seq[1:] { if n <= start { t.Fatalf("wrap seq is non-increasing: %v", seq) } if n > len(words) { t.Fatalf("wrap seq contains %d > %d: %v", n, len(words), seq) } size := -1 for _, s := range words[start:n] {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Apr 11 16:31:45 UTC 2022 - 3.7K bytes - Viewed (0)