- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 10 for IsSaturated (0.27 sec)
-
pkg/controller/deployment/util/deployment_util_test.go
tRS.Annotations[DesiredReplicasAnnotation] = "1" tRS.Status.AvailableReplicas = 1 tRS.Spec.Replicas = new(int32) *tRS.Spec.Replicas = 1 t.Run("IsSaturated", func(t *testing.T) { saturated := IsSaturated(&tDeployment, &tRS) if !saturated { t.Errorf("SetReplicasAnnotations Expected=true Obtained=false") } }) //Tear Down } func TestReplicasAnnotationsNeedUpdate(t *testing.T) {
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Fri Sep 08 09:10:50 UTC 2023 - 37.1K bytes - Viewed (0) -
pkg/controller/deployment/util/deployment_util.go
} } // IsSaturated checks if the new replica set is saturated by comparing its size with its deployment size. // Both the deployment and the replica set have to believe this replica set can own all of the desired // replicas in the deployment and the annotation helps in achieving that. All pods of the ReplicaSet // need to be available. func IsSaturated(deployment *apps.Deployment, rs *apps.ReplicaSet) bool {
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Fri Dec 15 07:09:11 UTC 2023 - 39.3K bytes - Viewed (0) -
pkg/controller/deployment/sync.go
return err } // If the new replica set is saturated, old replica sets should be fully scaled down. // This case handles replica set adoption during a saturated new replica set. if deploymentutil.IsSaturated(deployment, newRS) { for _, old := range controller.FilterActiveReplicaSets(oldRSs) {
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Wed Jul 05 23:39:52 UTC 2023 - 24.5K bytes - Viewed (0) -
src/vendor/golang.org/x/crypto/internal/poly1305/sum_generic.go
h := newMACGeneric(key) h.Write(msg) h.Sum(out) } func newMACGeneric(key *[32]byte) macGeneric { m := macGeneric{} initialize(key, &m.macState) return m } // macState holds numbers in saturated 64-bit little-endian limbs. That is, // the value of [x0, x1, x2] is x[0] + x[1] * 2⁶⁴ + x[2] * 2¹²⁸. type macState struct { // h is the main accumulator. It is to be interpreted modulo 2¹³⁰ - 5, but
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Jan 22 19:00:13 UTC 2024 - 9.6K bytes - Viewed (0) -
pkg/controller/deployment/sync_test.go
expectedNew: nil, expectedOld: []*apps.ReplicaSet{rs("foo-v2", 10, nil, newTimestamp), rs("foo-v1", 4, nil, oldTimestamp)}, }, { name: "saturated but broken new replica set does not affect old pods", deployment: newDeployment("foo", 2, nil, ptr.To(intstr.FromInt32(1)), ptr.To(intstr.FromInt32(1)), nil),
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Fri Sep 08 09:10:50 UTC 2023 - 21.1K bytes - Viewed (0) -
android/guava/src/com/google/common/util/concurrent/SmoothRateLimiter.java
* spend K saved permits. * </ol> * * <p>In summary, the time it takes to move to the left (spend K permits), is equal to the area of * the function of width == K. * * <p>Assuming we have saturated demand, the time to go from maxPermits to thresholdPermits is * equal to warmupPeriod. And the time to go from thresholdPermits to 0 is warmupPeriod/2. (The
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Tue Apr 04 09:45:04 UTC 2023 - 19.3K bytes - Viewed (0) -
guava/src/com/google/common/util/concurrent/SmoothRateLimiter.java
* spend K saved permits. * </ol> * * <p>In summary, the time it takes to move to the left (spend K permits), is equal to the area of * the function of width == K. * * <p>Assuming we have saturated demand, the time to go from maxPermits to thresholdPermits is * equal to warmupPeriod. And the time to go from thresholdPermits to 0 is warmupPeriod/2. (The
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Tue Apr 04 09:45:04 UTC 2023 - 19.3K bytes - Viewed (0) -
src/net/timeout_test.go
time.Sleep(timeout / 3) continue } if isENOBUFS(err) { t.Logf("WriteTo: %v", err) // We're looking for a deadline exceeded error, but if the kernel's // network buffers are saturated we may see ENOBUFS instead (see // https://go.dev/issue/49930). Give it some time to unsaturate. time.Sleep(backoff) backoff *= 2 continue }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed Jan 24 18:06:55 UTC 2024 - 30K bytes - Viewed (0) -
src/crypto/internal/edwards25519/scalar_fiat.go
// // functions synthesized for this Montgomery arithmetic require the // // input to be strictly less than the prime modulus (m), and also // // require the input to be in the unique saturated representation. // // All functions also ensure that these two properties are true of // // return values. // // // // Computed values: //
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Nov 10 18:45:00 UTC 2022 - 35.6K bytes - Viewed (0) -
src/cmd/compile/internal/walk/order.go
// The NeverZero policy avoids the overflow to 0 by setting the counter to one // after it reaches 255 and so, if an edge is executed at least one time, the entry is // never 0. // Another policy presented in the paper is the Saturated Counters policy which // freezes the counter when it reaches the value of 255. However, a range // of experiments showed that that decreases overall performance. o.append(ir.NewIfStmt(base.Pos,
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Mar 08 02:00:33 UTC 2024 - 42.7K bytes - Viewed (0)