- Sort Score
- Result 10 results
- Languages All
Results 41 - 50 of 149 for worst (0.05 sec)
-
cluster/gce/windows/smoke-test.sh
kubectl=kubectl linux_deployment_timeout=60 windows_deployment_timeout=600 output_file=/tmp/k8s-smoke-test.out function check_windows_nodes_are_ready { # kubectl filtering is the worst. statuses=$(${kubectl} get nodes -l kubernetes.io/os=windows \ -o jsonpath='{.items[*].status.conditions[?(@.type=="Ready")].status}') for status in $statuses; do if [[ $status == "False" ]]; then
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Fri May 24 07:02:51 UTC 2024 - 20.6K bytes - Viewed (0) -
staging/src/k8s.io/apiserver/pkg/server/options/encryptionconfig/config.go
// and the DEK/seed generation logic behave. In particular, the positive // interval and max TTL are closely related as the difference between // these values defines the worst case window in which the write DEK/seed // could expire due to the plugin going into an error state. The // worst case window divided by the negative interval defines the // minimum amount of times the server will attempt to return to a
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Thu May 16 16:56:39 UTC 2024 - 41.2K bytes - Viewed (0) -
src/runtime/mranges.go
func (a *addrRanges) add(r addrRange) { // The copies in this function are potentially expensive, but this data // structure is meant to represent the Go heap. At worst, copying this // would take ~160µs assuming a conservative copying rate of 25 GiB/s (the // copy will almost never trigger a page fault) for a 1 TiB heap with 4 MiB
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Mar 25 19:53:03 UTC 2024 - 14.5K bytes - Viewed (0) -
src/runtime/mgclimit.go
// It's possible that we're missing time because we crossed a // 2^(64-limiterEventBits) boundary between the start and end. // In this case, we're dropping that information. This is OK because // at worst it'll cause a transient hiccup that will quickly resolve // itself as all new timestamps begin on the other side of the boundary. // Such a hiccup should be incredibly rare. return } // Account for the event.
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Apr 22 22:07:41 UTC 2024 - 17.3K bytes - Viewed (0) -
staging/src/k8s.io/apiserver/pkg/storage/etcd3/watcher.go
} // If user couldn't receive results fast enough, we also block incoming events from watcher. // Because storing events in local will cause more memory usage. // The worst case would be closing the fast watcher. select { case wc.resultChan <- *res: case <-wc.ctx.Done(): return } case <-wc.ctx.Done(): return } } }
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Mon Sep 25 10:26:38 UTC 2023 - 18.9K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/CompactHashSet.java
* simply switch over to use the JDK implementation wholesale if probable hash flooding is * detected, sacrificing the compactness guarantee in very rare cases in exchange for much * more reliable worst-case behavior. * <li>null, if no entries have yet been added to the map * </ul> */ @CheckForNull private transient Object table; /**
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Tue May 28 18:11:09 UTC 2024 - 24K bytes - Viewed (0) -
src/cmd/internal/obj/ppc64/asm_test.go
hasNop bool }{ {[]byte(x0pgm), "align=0x0", false}, // No alignment or nop adjustments needed {[]byte(x16pgm), "align=0x20", false}, // Increased alignment needed {[]byte(x32pgm), "align=0x40", false}, // Worst case alignment needed {[]byte(x64pgm), "align=0x0", true}, // 0 aligned is default (16B) alignment {[]byte(x64pgmA64), "align=0x40", true}, // extra alignment + nop
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Feb 09 22:14:57 UTC 2024 - 17.3K bytes - Viewed (0) -
src/crypto/ecdsa/ecdsa.go
func hashToNat[Point nistPoint[Point]](c *nistCurve[Point], e *bigmod.Nat, hash []byte) { // ECDSA asks us to take the left-most log2(N) bits of hash, and use them as // an integer modulo N. This is the absolute worst of all worlds: we still // have to reduce, because the result might still overflow N, but to take // the left-most bits for P-521 we have to do a right shift. if size := c.N.Size(); len(hash) >= size { hash = hash[:size]
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu May 23 00:11:18 UTC 2024 - 20.4K bytes - Viewed (0) -
guava/src/com/google/common/collect/CompactHashSet.java
* simply switch over to use the JDK implementation wholesale if probable hash flooding is * detected, sacrificing the compactness guarantee in very rare cases in exchange for much * more reliable worst-case behavior. * <li>null, if no entries have yet been added to the map * </ul> */ @CheckForNull private transient Object table; /**
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Tue May 28 18:11:09 UTC 2024 - 24.9K bytes - Viewed (0) -
src/text/template/parse/parse.go
// Are there declarations or assignments? decls: if v := t.peekNonSpace(); v.typ == itemVariable { t.next() // Since space is a token, we need 3-token look-ahead here in the worst case: // in "$x foo" we need to read "foo" (as opposed to ":=") to know that $x is an // argument variable rather than a declaration. So remember the token // adjacent to the variable so we can push it back if necessary.
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Feb 26 20:57:51 UTC 2024 - 21.3K bytes - Viewed (0)