- Sort Score
- Result 10 results
- Languages All
Results 81 - 90 of 124 for createfing (0.29 sec)
-
staging/src/k8s.io/apiextensions-apiserver/test/integration/ratcheting_test.go
name: "sentinel-resource", patch: map[string]interface{}{ sentinelName: fmt.Sprintf("invalid-%d", counter), }}.Do(ctx) if err == nil { return false, errors.New("expected error when creating sentinel resource") } // Check to see if the returned error message contains our // unique string. UUID should be unique enough to just check // simple existence in the error.
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Tue May 28 08:48:22 UTC 2024 - 59.5K bytes - Viewed (0) -
pilot/pkg/serviceregistry/serviceregistry_test.go
newPod, err = c.CoreV1().Pods(pod.Namespace).Update(context.Background(), pod, metav1.UpdateOptions{}) } if err != nil { t.Fatal(err) } // Apiserver doesn't allow Create/Update to modify the pod status. Creating doesn't result in // events - since PodIP will be "". newPod.Status.PodIP = pod.Status.PodIP newPod.Status.PodIPs = []v1.PodIP{ { IP: pod.Status.PodIP, }, }
Registered: Fri Jun 14 15:00:06 UTC 2024 - Last Modified: Thu May 23 21:07:03 UTC 2024 - 51.2K bytes - Viewed (0) -
src/runtime/mheap.go
} other.first, other.last = nil, nil } const ( // _KindSpecialFinalizer is for tracking finalizers. _KindSpecialFinalizer = 1 // _KindSpecialWeakHandle is used for creating weak pointers. _KindSpecialWeakHandle = 2 // _KindSpecialProfile is for memory profiling. _KindSpecialProfile = 3 // _KindSpecialReachable is a special used for tracking // reachability during testing.
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed May 22 22:31:00 UTC 2024 - 78K bytes - Viewed (0) -
src/cmd/go/internal/modload/load.go
if modAddedBy[mod] == nil { modAddedBy[mod] = pkg } } return modAddedBy, nil } // pkg locates the *loadPkg for path, creating and queuing it for loading if // needed, and updates its state to reflect the given flags. // // The imports of the returned *loadPkg will be loaded asynchronously in the
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu May 30 14:56:56 UTC 2024 - 84K bytes - Viewed (0) -
src/cmd/link/internal/ld/lib.go
// libmingwex.a and libmingw32.a: /* for: #cgo windows LDFLAGS: -lmsvcrt -lm import: libmsvcrt.a libm.a */ } // loadcgodirectives reads the previously discovered cgo directives, creating // symbols in preparation for host object loading or use later in the link. func (ctxt *Link) loadcgodirectives() { l := ctxt.loader hostObjSyms := make(map[loader.Sym]struct{}) for _, d := range ctxt.cgodata {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue May 21 18:45:27 UTC 2024 - 88.6K bytes - Viewed (0) -
pkg/controller/nodelifecycle/node_lifecycle_controller.go
status: &node.Status, probeTimestamp: nc.now(), readyTransitionTimestamp: nc.now(), } } else if savedCondition == nil && currentReadyCondition != nil { logger.V(1).Info("Creating timestamp entry for newly observed Node", "node", klog.KObj(node)) nodeHealth = &nodeHealthData{ status: &node.Status, probeTimestamp: nc.now(), readyTransitionTimestamp: nc.now(),
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Sat May 04 18:33:12 UTC 2024 - 51.6K bytes - Viewed (0) -
staging/src/k8s.io/apimachinery/pkg/api/resource/quantity_test.go
continue } if asDec { got.AsDec() } for _, format := range []Format{DecimalSI, BinarySI, DecimalExponent} { // ensure we are not simply checking pointer equality by creating a new inf.Dec var copied inf.Dec copied.Add(inf.NewDec(0, inf.Scale(0)), got.AsDec()) q := NewDecimalQuantity(copied, format) if c := q.Cmp(got); c != 0 {
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Wed May 29 21:48:10 UTC 2024 - 49.4K bytes - Viewed (0) -
tensorflow/compiler/jit/deadness_analysis.cc
// `pred` implies that `n` is live whenever `pred` is true. Then we can deduce // mismatching liveness in the inputs to node by comparing the predicate those // inputs are mapped to. The core logic of this pass resides in creating the // map from TensorFlow nodes to predicates. // // // MAPPING NODES TO PREDICATES, MODULO CYCLES // ------------------------------------------ // // If we ignore cycles for a moment, computing predicates is fairly
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Tue Mar 12 06:33:33 UTC 2024 - 60.4K bytes - Viewed (0) -
tensorflow/compiler/mlir/lite/flatbuffer_import.cc
builder)); } if (op_name == "tfl.while") { // Adds two empty regions for "tfl.while". We will fill the regions after // creating the callee functions because the "tfl.while" input/output types // may be different with the callee functions, and the call ops need to sync // with callee function types. op_state.addRegion();
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Tue May 21 18:21:50 UTC 2024 - 66.8K bytes - Viewed (0) -
guava/src/com/google/common/base/Preconditions.java
* decade that assumes that they can use checkNotNull for non-precondition checks. I had hoped to * take a principled stand on this, but the amount of such code is simply overwhelming. To avoid * creating a lot of compile errors that users would not find to be informative, we're giving in * and allowing callers to pass arguments that a nullness checker believes could be null. *
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Thu Apr 11 11:52:14 UTC 2024 - 52.9K bytes - Viewed (0)