- Sort Score
- Result 10 results
- Languages All
Results 11 - 20 of 236 for perfunc (0.25 sec)
-
staging/src/k8s.io/apiextensions-apiserver/pkg/registry/customresourcedefinition/etcd.go
if crd.DeletionTimestamp.IsZero() { key, err := r.Store.KeyFunc(ctx, name) if err != nil { return nil, false, err } preconditions := storage.Preconditions{UID: options.Preconditions.UID, ResourceVersion: options.Preconditions.ResourceVersion} out := r.Store.NewFunc() err = r.Store.Storage.GuaranteedUpdate( ctx, key, out, false, &preconditions,
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Fri Nov 18 09:21:19 UTC 2022 - 8K bytes - Viewed (0) -
pkg/scheduler/internal/heap/heap.go
// according to the heap invariant. The queue keeps the keys of objects stored // in "items". queue []string // keyFunc is used to make the key used for queued item insertion and retrieval, and // should be deterministic. keyFunc KeyFunc // lessFunc is used to compare two objects in the heap. lessFunc lessFunc } var ( _ = heap.Interface(&data{}) // heapData is a standard heap )
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Fri Apr 29 18:37:35 UTC 2022 - 6.7K bytes - Viewed (0) -
src/cmd/compile/internal/typecheck/dcl.go
funcStack = append(funcStack, ir.CurFunc) ir.CurFunc = fn } // FinishFuncBody restores ir.CurFunc to its state before the last // call to DeclFunc. func FinishFuncBody() { funcStack, ir.CurFunc = funcStack[:len(funcStack)-1], funcStack[len(funcStack)-1] } func CheckFuncStack() { if len(funcStack) != 0 { base.Fatalf("funcStack is non-empty: %v", len(funcStack)) } } // make a new Node off the books.
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Sep 14 13:15:50 UTC 2023 - 3.1K bytes - Viewed (0) -
src/cmd/compile/internal/walk/complit.go
// TODO(khr): assign these temps in order phase so we can reuse them across multiple maplits? tmpkey := typecheck.TempAt(base.Pos, ir.CurFunc, m.Type().Key()) tmpelem := typecheck.TempAt(base.Pos, ir.CurFunc, m.Type().Elem()) for _, r := range entries { r := r.(*ir.KeyExpr) index, elem := r.Key, r.Value ir.SetPos(index)
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Sep 08 19:03:54 UTC 2023 - 19.5K bytes - Viewed (0) -
pkg/registry/core/namespace/storage/storage.go
if namespace.DeletionTimestamp.IsZero() { key, err := r.store.KeyFunc(ctx, name) if err != nil { return nil, false, err } preconditions := storage.Preconditions{UID: options.Preconditions.UID, ResourceVersion: options.Preconditions.ResourceVersion} out := r.store.NewFunc() err = r.store.Storage.GuaranteedUpdate( ctx, key, out, false, &preconditions,
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Fri Nov 18 09:21:19 UTC 2022 - 13.4K bytes - Viewed (0) -
src/cmd/compile/internal/ssagen/abi.go
n := ir.NewReturnStmt(base.Pos, nil) n.Results = []ir.Node{call} tail = n } fn.Body.Append(tail) typecheck.FinishFuncBody() ir.CurFunc = fn typecheck.Stmts(fn.Body) // Restore previous context. base.Pos = savepos ir.CurFunc = savedcurfn } // CreateWasmImportWrapper creates a wrapper for imported WASM functions to // adapt them to the Go calling convention. The body for this function is
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed May 15 19:57:43 UTC 2024 - 13.8K bytes - Viewed (0) -
test/typeparam/issue49309.go
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Aug 18 17:26:40 UTC 2022 - 367 bytes - Viewed (0) -
src/cmd/compile/internal/walk/builtin.go
nl := typecheck.TempAt(base.Pos, ir.CurFunc, n.X.Type()) nr := typecheck.TempAt(base.Pos, ir.CurFunc, n.Y.Type()) var l []ir.Node l = append(l, ir.NewAssignStmt(base.Pos, nl, n.X)) l = append(l, ir.NewAssignStmt(base.Pos, nr, n.Y)) nfrm := ir.NewUnaryExpr(base.Pos, ir.OSPTR, nr) nto := ir.NewUnaryExpr(base.Pos, ir.OSPTR, nl) nlen := typecheck.TempAt(base.Pos, ir.CurFunc, types.Types[types.TINT]) // n = len(to)
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Mar 08 22:35:22 UTC 2024 - 31.2K bytes - Viewed (0) -
pkg/volume/csi/csi_test.go
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Thu Nov 03 15:55:13 UTC 2022 - 21.1K bytes - Viewed (0) -
test/fixedbugs/issue56923.go
// license that can be found in the LICENSE file. package p type Eq[T any] interface { Eqv(a T, b T) bool } type EqFunc[T any] func(a, b T) bool func (r EqFunc[T]) Eqv(a, b T) bool { return r(a, b) } func New[T any](f func(a, b T) bool) Eq[T] { return EqFunc[T](f) } func Equal(a, b []byte) bool { return string(a) == string(b) }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Dec 14 17:22:18 UTC 2023 - 496 bytes - Viewed (0)