- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 38 for pruned (0.17 sec)
-
src/cmd/go/internal/modload/buildlist.go
} // We are converting an unpruned module to a pruned one. // // An unpruned module graph includes the transitive dependencies of every // module in the build list. As it turns out, we can express that as a pruned // root set! “Include the transitive dependencies of every module in the build // list” is exactly what happens in a pruned module if we promote every module // in the build list to a root.
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed May 15 16:04:44 UTC 2024 - 53.8K bytes - Viewed (0) -
src/cmd/go/internal/modload/load.go
// pkg had an error in with a pruned module graph (presumably suppressed // with the -e flag), but the error went away using an unpruned graph. // // This is possible, if, say, the import is unresolved in the pruned graph // (because the "latest" version of each candidate module either is // unavailable or does not contain the package), but is resolved 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) -
staging/src/k8s.io/apiextensions-apiserver/pkg/apis/apiextensions/validation/validation.go
} if errs := structuralschema.ValidateStructural(nil, ss); len(errs) > 0 { return false, errs.ToAggregate() } pruned := ss.DeepCopy() if err := structuraldefaulting.PruneDefaults(pruned); err != nil { return false, err } return !reflect.DeepEqual(ss, pruned), nil } // requireAtomicSetType returns true if the old CRD spec as at least one x-kubernetes-list-type=set with non-atomic items type.
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Fri May 10 22:07:40 UTC 2024 - 82.6K bytes - Viewed (0) -
src/cmd/go/internal/modload/init.go
// Go 1.11 through 1.16 do not support graph pruning, but the latest Go // version uses a pruned module graph — so we need to convert the // requirements to support pruning. if gover.Compare(v, gover.ExplicitIndirectVersion) >= 0 { var err error rs, err = convertPruning(ctx, rs, pruned) if err != nil { return nil, err } } } else {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Jun 06 18:36:30 UTC 2024 - 69.8K bytes - Viewed (0) -
pkg/controller/daemon/daemon_controller.go
// There are no excess pods to be pruned, and no pods to create break } sort.Sort(podByCreationTimestampAndPhase(daemonPodsRunning)) for i := 1; i < len(daemonPodsRunning); i++ { podsToDelete = append(podsToDelete, daemonPodsRunning[i].Name) } break } if len(daemonPodsRunning) <= 1 { // // There are no excess pods to be pruned if len(daemonPodsRunning) == 0 && shouldRun {
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Sat May 04 18:33:12 UTC 2024 - 51.3K bytes - Viewed (0) -
tensorflow/compiler/mlir/g3doc/_includes/tf_passes.md
turned in to a zero-initialized buffer, and the size is initialized to 0 for `tf.EmptyTensorList` or the specified size for `tf.TensorListReserve`. Each push will be turned into `tf.XlaDynamicUpdateSlice` with the incremented size, and each pop will be turned into a `tf.Slice` and a copy of the buffer with decremented size. Each `tf.TensorListSetItem` will be turned into a
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Wed Aug 02 02:26:39 UTC 2023 - 96.4K bytes - Viewed (0) -
staging/src/k8s.io/apiextensions-apiserver/pkg/apiserver/customresource_handler.go
}, }, Components: &spec3.Components{ Schemas: staticOpenAPISpec, }, } specs := []*spec3.OpenAPI{staticSpecV3} for _, v := range crd.Spec.Versions { // Defaults are not pruned here, but before being served. // See flag description in builder.go for flag usage s, err := builder.BuildOpenAPIV3(crd, v.Name, builder.Options{}) if err != nil { return nil, err }
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Wed Feb 28 19:06:46 UTC 2024 - 52.9K bytes - Viewed (0) -
tensorflow/compiler/mlir/lite/flatbuffer_import.cc
// other end of the incoming edges. Since we're proceding in a valid // topological order, all lookups of these tokens in // (*control_nodes)[incoming] should be valid. However, we might (in theory) // have pruned an operator above, so we only emit values that have been // populated. llvm::SmallVector<Value, 2> control_tokens; for (const int incoming : maybe_control_node->second.incoming) {
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Tue May 21 18:21:50 UTC 2024 - 66.8K bytes - Viewed (0) -
cmd/kubelet/app/server.go
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Fri Jun 07 00:05:34 UTC 2024 - 53.9K bytes - Viewed (0) -
src/cmd/compile/internal/ssa/debug.go
for i := len(preds) - 1; i >= 0; i-- { pred := preds[i] if blockLocs[pred.ID].lastChangedTime > locs.lastCheckedTime { continue // keep this predecessor } preds[i] = preds[len(preds)-1] preds = preds[:len(preds)-1] if state.loggingLevel > 2 { state.logf("Pruned b%d, lastChanged was %d but b%d lastChecked is %d\n", pred.ID, blockLocs[pred.ID].lastChangedTime, b.ID, locs.lastCheckedTime) } }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Jun 10 19:44:43 UTC 2024 - 58.4K bytes - Viewed (0)