- Sort Score
- Result 10 results
- Languages All
Results 1 - 3 of 3 for newElems (0.1 sec)
-
staging/src/k8s.io/apiextensions-apiserver/pkg/apiserver/schema/cel/model/adaptor.go
// validations, and doesn't cost too much since since we are usually exploring the // entire schema anyway. func nestedValueValidationToStructural(nvv *schema.NestedValueValidation) *Structural { var newItems *schema.Structural if nvv.Items != nil { newItems = nestedValueValidationToStructural(nvv.Items).Structural } var newProperties map[string]schema.Structural for k, v := range nvv.Properties { if newProperties == nil {
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Thu May 16 20:13:14 UTC 2024 - 8.2K bytes - Viewed (0) -
src/runtime/mcentral.go
havespan: if !traceDone { trace := traceAcquire() if trace.ok() { trace.GCSweepDone() traceRelease(trace) } } n := int(s.nelems) - int(s.allocCount) if n == 0 || s.freeindex == s.nelems || s.allocCount == s.nelems { throw("span has no free objects") } freeByteBase := s.freeindex &^ (64 - 1) whichByte := freeByteBase / 8 // Init alloc bits cache.
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Mar 25 19:53:03 UTC 2024 - 8.1K bytes - Viewed (0) -
src/runtime/traceallocfree.go
// Write out allocated objects if it's a heap span. if s.state.get() != mSpanInUse { continue } // Find all allocated objects. abits := s.allocBitsForIndex(0) for i := uintptr(0); i < uintptr(s.nelems); i++ { if abits.index < uintptr(s.freeindex) || abits.isMarked() { x := s.base() + i*s.elemsize trace.HeapObjectExists(x, s.typePointersOfUnchecked(x).typ) } abits.advance() } }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed May 22 20:32:51 UTC 2024 - 5.9K bytes - Viewed (0)