- Sort Score
- Result 10 results
- Languages All
Results 11 - 20 of 1,066 for light (0.04 sec)
-
src/compress/bzip2/huffman.go
} else { node.left, err = buildHuffmanNode(t, left, level+1) } if err != nil { return } if len(right) == 1 { // leaf node node.right = invalidNodeValue node.rightValue = right[0].value } else { node.right, err = buildHuffmanNode(t, right, level+1) } return
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Apr 15 17:44:37 UTC 2024 - 6.7K bytes - Viewed (0) -
pkg/controller/resourceclaim/controller.go
*newPodClaims = make(map[string]string) } (*newPodClaims)[podClaim.Name] = claim.Name return nil } // findPodResourceClaim looks for an existing ResourceClaim with the right // annotation (ties it to the pod claim) and the right ownership (ties it to // the pod). func (ec *Controller) findPodResourceClaim(pod *v1.Pod, podClaim v1.PodResourceClaim) (*resourcev1alpha2.ResourceClaim, error) {
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Thu May 09 03:34:25 UTC 2024 - 37.1K bytes - Viewed (0) -
pilot/pkg/xds/endpoints/endpoint_builder.go
} // addUint32AvoidOverflow returns sum of two uint32 and status. If sum overflows, // and returns MaxUint32 and status. func addUint32(left, right uint32) (uint32, bool) { if math.MaxUint32-right < left { return math.MaxUint32, true } return left + right, false } func (b *EndpointBuilder) filterIstioEndpoint(ep *model.IstioEndpoint) bool { // for ServiceInternalTrafficPolicy
Registered: Fri Jun 14 15:00:06 UTC 2024 - Last Modified: Sun Apr 28 02:18:19 UTC 2024 - 26.1K bytes - Viewed (0) -
pkg/apis/core/types.go
// and PersistentVolumeClaim). // // Use PersistentVolumeClaim or one of the vendor-specific // APIs for volumes that persist for longer than the lifecycle // of an individual pod. // // Use CSI for light-weight local ephemeral volumes if the CSI driver is meant to // be used that way - see the documentation of the driver for // more information. // // A pod can use both types of ephemeral volumes and
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Wed May 29 22:40:29 UTC 2024 - 268.9K bytes - Viewed (0) -
staging/src/k8s.io/api/core/v1/types_swagger_doc_generated.go
}
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Wed May 29 22:40:29 UTC 2024 - 254.8K bytes - Viewed (0) -
src/slices/slices.go
} if n+m > cap(s) { // Use append rather than make so that we bump the size of // the slice up to the next storage class. // This is what Grow does but we don't call Grow because // that might copy the values twice. s2 := append(s[:i], make(S, n+m-i)...) copy(s2[i:], v) copy(s2[i+m:], s[i:]) return s2 } s = s[:n+m] // before: // s: aaaaaaaabbbbccccccccdddd
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Apr 29 14:01:59 UTC 2024 - 13.6K bytes - Viewed (0) -
src/runtime/mgclimit.go
return false } e.stamp.Store(uint64(makeLimiterEventStamp(typ, now))) return true } // consume acquires the partial event CPU time from any in-flight event. // It achieves this by storing the current time as the new event time. // // Returns the type of the in-flight event, as well as how long it's currently been // executing for. Returns limiterEventNone if no event is active.
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Apr 22 22:07:41 UTC 2024 - 17.3K bytes - Viewed (0) -
src/cmd/go/internal/modindex/scan.go
func importRaw(modroot, reldir string) *rawPackage { p := &rawPackage{ dir: reldir, } absdir := filepath.Join(modroot, reldir) // We still haven't checked // that p.dir directory exists. This is the right time to do that check. // We can't do it earlier, because we want to gather partial information for the // non-nil *build.Package returned when an error occurs. // We need to do this before we return early on FindOnly flag.
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Mar 26 19:58:28 UTC 2024 - 8.5K bytes - Viewed (0) -
src/cmd/compile/internal/walk/order.go
// as2func orders OAS2FUNC nodes. It creates temporaries to ensure left-to-right assignment. // The caller should order the right-hand side of the assignment before calling order.as2func. // It rewrites, // // a, b, a = ... // // as // // tmp1, tmp2, tmp3 = ... // a, b, a = tmp1, tmp2, tmp3 // // This is necessary to ensure left to right assignment order. func (o *orderState) as2func(n *ir.AssignListStmt) {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Mar 08 02:00:33 UTC 2024 - 42.7K bytes - Viewed (0) -
src/cmd/compile/internal/ssa/_gen/RISCV64Ops.go
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Mar 07 14:57:07 UTC 2024 - 30.7K bytes - Viewed (0)