- Sort Score
- Result 10 results
- Languages All
Results 41 - 50 of 58 for circuit (0.54 sec)
-
src/runtime/pprof/proto.go
// the stack and we have return PCs anyway. frames := runtime.CallersFrames([]uintptr{addr}) frame, more := frames.Next() if frame.Function == "runtime.goexit" { // Short-circuit if we see runtime.goexit so the loop // below doesn't allocate a useless empty location. return nil, 0 } symbolizeResult := lookupTried
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed Dec 13 20:40:52 UTC 2023 - 25.7K bytes - Viewed (0) -
src/cmd/compile/internal/types2/named.go
// their expansion. Via the pidgeonhole principle, this guarantees that in the // presence of a cycle of named types, expansion will eventually find an // existing instance in the Context and short-circuit the expansion. // // Once an instance is complete, we can nil out this shared Context to unpin // memory, though this Context may still be held by other incomplete instances // in its "lineage".
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed May 15 20:03:31 UTC 2024 - 23.9K bytes - Viewed (0) -
pkg/dns/client/dns.go
// We will resolve www.google.com.ns1.svc.cluster.local with a CNAME record pointing to www.google.com. // which will cause the client's resolver to automatically resolve www.google.com. , and short circuit the lengthy // search process down to just two DNS queries. This will eliminate unnecessary upstream DNS queries from the // agent, reduce load on DNS servers and improve overall latency. This idea was borrowed and adapted from
Registered: Fri Jun 14 15:00:06 UTC 2024 - Last Modified: Thu Feb 29 16:17:34 UTC 2024 - 23.9K bytes - Viewed (0) -
src/cmd/go/internal/modindex/build.go
l := strings.Split(name, "_") if n := len(l); n > 0 && l[n-1] == "test" { l = l[:n-1] } n := len(l) if n >= 2 && knownOS[l[n-2]] && knownArch[l[n-1]] { if allTags != nil { // In case we short-circuit on l[n-1]. allTags[l[n-2]] = true } return ctxt.matchTag(l[n-1], allTags) && ctxt.matchTag(l[n-2], allTags) } if n >= 1 && (knownOS[l[n-1]] || knownArch[l[n-1]]) { return ctxt.matchTag(l[n-1], allTags)
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Aug 25 17:39:23 UTC 2023 - 26.8K bytes - Viewed (0) -
src/go/types/named.go
// their expansion. Via the pidgeonhole principle, this guarantees that in the // presence of a cycle of named types, expansion will eventually find an // existing instance in the Context and short-circuit the expansion. // // Once an instance is complete, we can nil out this shared Context to unpin // memory, though this Context may still be held by other incomplete instances // in its "lineage".
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed May 15 20:03:31 UTC 2024 - 24K bytes - Viewed (0) -
pkg/controller/statefulset/stateful_set_control.go
return &status, err } updateStatus(&status, set.Spec.MinReadySeconds, currentRevision, updateRevision, replicas, condemned) // for the OnDelete strategy we short circuit. Pods will be updated when they are manually deleted. if set.Spec.UpdateStrategy.Type == apps.OnDeleteStatefulSetStrategyType { return &status, nil }
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Thu Apr 18 08:03:46 UTC 2024 - 30.9K bytes - Viewed (0) -
src/cmd/go/internal/modfetch/codehost/git.go
} if len(tags.List) == 0 { return false, nil } // NOTE: r.stat is very careful not to fetch commits that we shouldn't know // about, like rejected GitHub pull requests, so don't try to short-circuit // that here. if _, err = r.stat(ctx, rev); err != nil { return false, err } // Now fetch history so that git can search for a path. unlock, err := r.mu.Lock() if err != nil {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Mar 11 22:10:38 UTC 2024 - 27.4K bytes - Viewed (0) -
cmd/object-api-utils.go
} // Did not match any inclusion filters, exclude from compression. return true } // Utility which returns if a string is present in the list. // Comparison is case insensitive. Explicit short-circuit if // the list contains the wildcard "*". func hasStringSuffixInSlice(str string, list []string) bool { str = strings.ToLower(str) for _, v := range list { if v == "*" { return true }
Registered: Sun Jun 16 00:44:34 UTC 2024 - Last Modified: Tue Jun 11 03:13:30 UTC 2024 - 36.3K bytes - Viewed (0) -
pkg/controller/controller_utils.go
// any API calls. func RemoveTaintOffNode(ctx context.Context, c clientset.Interface, nodeName string, node *v1.Node, taints ...*v1.Taint) error { if len(taints) == 0 { return nil } // Short circuit for limiting amount of API calls. if node != nil { match := false for _, taint := range taints { if taintutils.TaintExists(node.Spec.Taints, taint) { match = true break } }
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Fri Jan 12 15:34:44 UTC 2024 - 47.6K bytes - Viewed (0) -
src/cmd/compile/internal/walk/order.go
rhs := o.expr(n.Y, nil) o.out = append(o.out, typecheck.Stmt(ir.NewAssignStmt(base.Pos, r, rhs))) o.popTemp(t) gen := o.out o.out = saveout // If left-hand side doesn't cause a short-circuit, issue right-hand side. nif := ir.NewIfStmt(base.Pos, r, nil, nil) if n.Op() == ir.OANDAND { nif.Body = gen } else { nif.Else = gen } o.out = append(o.out, nif) return r
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Mar 08 02:00:33 UTC 2024 - 42.7K bytes - Viewed (0)