- Sort Score
- Result 10 results
- Languages All
Results 101 - 110 of 152 for circuit (0.84 sec)
-
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) -
src/text/template/exec_test.go
{"or", "{{or 0 0}} {{or 1 0}} {{or 0 true}} {{or 1 1}}", "0 1 true 1", nil, true}, {"or short-circuit", "{{or 0 1 (die)}}", "1", nil, true}, {"and short-circuit", "{{and 1 0 (die)}}", "0", nil, true}, {"or short-circuit2", "{{or 0 0 (die)}}", "", nil, false}, {"and short-circuit2", "{{and 1 1 (die)}}", "", nil, false}, {"and pipe-true", "{{1 | and 1}}", "1", nil, true},
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri May 24 22:23:55 UTC 2024 - 60.1K 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) -
pilot/pkg/config/kube/gateway/conversion.go
routeHost := host.Name(rawRouteHost) ourListener := host.Name(r.Hostname) if len(ourListener) > 0 && !ourListener.IsWildCarded() { // Short circuit: this logic only applies to wildcards // Not required for correctness, just an optimization return true } if len(ourListener) > 0 && !routeHost.Matches(ourListener) { return false }
Registered: Fri Jun 14 15:00:06 UTC 2024 - Last Modified: Fri Jun 14 04:34:37 UTC 2024 - 84.7K 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) -
src/net/http/server.go
// 6. the rwc, the [net.Conn]. // // TODO(bradfitz): short-circuit some of the buffering when the // initial header contains both a Content-Type and Content-Length. // Also short-circuit in (1) when the header's been sent and not in // chunking mode, writing directly to (4) instead, if (2) has no // buffered data. More generally, we could short-circuit from (1) to // (3) even in chunking mode if the write size from (1) is over some
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Jun 07 17:57:01 UTC 2024 - 123.4K bytes - Viewed (0) -
prow/config/calico.yaml
\"c\" \thas(label_name) -> True if that label is present \t! expr -> negation of expr \texpr && expr -> Short-circuit and \texpr || expr -> Short-circuit or \t( expr ) -> parens for grouping \tall() or the empty selector -> matches all endpoints. \n Label names are
Registered: Fri Jun 14 15:00:06 UTC 2024 - Last Modified: Tue May 21 18:32:01 UTC 2024 - 246.5K bytes - Viewed (0) -
guava/src/com/google/common/reflect/TypeToken.java
@CanIgnoreReturnValue private int collectTypes(K type, Map<? super K, Integer> map) { Integer existing = map.get(type); if (existing != null) { // short circuit: if set contains type it already contains its supertypes return existing; } // Interfaces should be listed before Object. int aboveMe = getRawType(type).isInterface() ? 1 : 0;
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Mon Jun 26 21:02:13 UTC 2023 - 53.6K bytes - Viewed (0)