- Sort Score
- Result 10 results
- Languages All
Results 11 - 13 of 13 for rightLen (0.16 sec)
-
src/go/types/object.go
// nil Func.Type was lazily populated, indicating // a types bug; or // - by a client after NewFunc(..., nil), // which is arguably a client bug, but we need a // proposal to tighten NewFunc's precondition. // For now, return a trivial signature. return new(Signature) } // FullName returns the package- or receiver-type-qualified name of // function or method obj.
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue May 07 20:08:23 UTC 2024 - 20.1K bytes - Viewed (0) -
pkg/registry/core/service/storage/alloc.go
// Henceforth we can assume ipFamilyPolicy is set. // Do some loose pre-validation of the input. This makes it easier in the // rest of allocation code to not have to consider corner cases. // TODO(thockin): when we tighten validation (e.g. to require IPs) we will // need a "strict" and a "loose" form of this. if el := validation.ValidateServiceClusterIPsRelatedFields(service); len(el) != 0 {
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Tue Oct 31 21:05:05 UTC 2023 - 37.3K bytes - Viewed (0) -
src/math/big/natdiv.go
< 2 + 1 [above: x₁/y₁ - x/y < 2] = 3 So q̂ - q < 3. Since q̂ - q is an integer, q̂ - q ≤ 2. Note that when x/y < T/2, the bounds tighten to x₁/y₁ - x/y < 1 and therefore q̂ - q ≤ 1. Note also that in the general case 2n-by-n division where we don't know that x/y < T, we do know that x/y < 2T, yielding the bound q̂ - q ≤ 4. So we could
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Mar 14 17:02:38 UTC 2024 - 34.4K bytes - Viewed (0)