- Sort Score
- Result 10 results
- Languages All
Results 1 - 5 of 5 for unweighted (0.18 sec)
-
pilot/pkg/config/kube/gateway/testdata/weighted.status.yaml.golden
Lior Lieberman <******@****.***> 1707338903 +0000
Registered: Fri Jun 14 15:00:06 UTC 2024 - Last Modified: Wed Feb 07 20:48:23 UTC 2024 - 3.4K bytes - Viewed (0) -
src/cmd/vendor/golang.org/x/sync/semaphore/semaphore.go
func NewWeighted(n int64) *Weighted { w := &Weighted{size: n} return w } // Weighted provides a way to bound concurrent access to a resource. // The callers can request access with a given weight. type Weighted struct { size int64 cur int64 mu sync.Mutex waiters list.List } // Acquire acquires the semaphore with a weight of n, blocking until resources
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri May 03 02:38:00 UTC 2024 - 4.3K bytes - Viewed (0) -
pkg/scheduler/framework/extender.go
// Prioritize based on extender-implemented priority functions. The returned scores & weight // are used to compute the weighted score for an extender. The weighted scores are added to // the scores computed by Kubernetes scheduler. The total scores are used to do the host selection.
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Mon Feb 26 19:07:19 UTC 2024 - 3.3K bytes - Viewed (0) -
src/cmd/compile/internal/types2/mono.go
// types derived thereof). A package cannot be statically instantiated // if the graph has any cycles involving at least one derived type. // // Concretely, we construct a directed, weighted graph. Vertices are // used to represent type parameters as well as some defined // types. Edges are used to represent how types depend on each other: // // * Everywhere a type-parameterized function or type is instantiated,
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed Feb 28 00:05:29 UTC 2024 - 9.1K bytes - Viewed (0) -
src/go/types/mono.go
// types derived thereof). A package cannot be statically instantiated // if the graph has any cycles involving at least one derived type. // // Concretely, we construct a directed, weighted graph. Vertices are // used to represent type parameters as well as some defined // types. Edges are used to represent how types depend on each other: // // * Everywhere a type-parameterized function or type is instantiated,
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed Apr 03 18:48:38 UTC 2024 - 9.2K bytes - Viewed (0)