- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 30 for Po (0.02 sec)
-
src/cmd/compile/internal/ssa/poset.go
if po.roots[i] == r { return true } } return false } func (po *poset) changeroot(oldr, newr uint32) { for i := range po.roots { if po.roots[i] == oldr { po.roots[i] = newr return } } panic("changeroot on non-root") } func (po *poset) removeroot(r uint32) { for i := range po.roots { if po.roots[i] == r {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Sep 04 17:23:05 UTC 2023 - 37.2K bytes - Viewed (0) -
docs/pl/docs/features.md
* Automatyczna dokumentacja modelu danych za pomocą <a href="https://json-schema.org/" class="external-link" target="_blank"><strong>JSON Schema</strong></a> (ponieważ OpenAPI bazuje na JSON Schema). * Zaprojektowane z myślą o zgodności z powyższymi standardami zamiast dodawania ich obsługi po fakcie.
Registered: Mon Jun 17 08:32:26 UTC 2024 - Last Modified: Thu Apr 18 19:53:19 UTC 2024 - 10.9K bytes - Viewed (0) -
src/cmd/compile/internal/ssa/likelyadjust.go
innermost.nBlocks++ } visited[b.ID] = true } ln := &loopnest{f: f, b2l: b2l, po: po, sdom: sdom, loops: loops, hasIrreducible: sawIrred} // Calculate containsUnavoidableCall for regalloc dominatedByCall := f.Cache.allocBoolSlice(f.NumBlocks()) defer f.Cache.freeBoolSlice(dominatedByCall) for _, b := range po { if checkContainsCall(b) { dominatedByCall[b.ID] = true } }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Oct 31 21:41:20 UTC 2022 - 15.4K bytes - Viewed (0) -
staging/src/k8s.io/apiserver/pkg/endpoints/handlers/patch.go
func patchToUpdateOptions(po *metav1.PatchOptions) *metav1.UpdateOptions { if po == nil { return nil } uo := &metav1.UpdateOptions{ DryRun: po.DryRun, FieldManager: po.FieldManager, FieldValidation: po.FieldValidation, } uo.TypeMeta.SetGroupVersionKind(metav1.SchemeGroupVersion.WithKind("UpdateOptions")) return uo
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Tue May 28 08:48:22 UTC 2024 - 28.5K bytes - Viewed (0) -
tensorflow/compiler/mlir/tensorflow/tests/tpu_validate_inputs.mlir
%out, %c1 = tf_executor.island wraps "tf.opA"(%pi) {_tpu_replicate = "cluster"} : (tensor<i32>) -> tensor<i32> %po:2, %c2 = tf_executor.island wraps "tf.TPUPartitionedOutput"(%out) : (tensor<i32>) -> (tensor<i32>, tensor<i32>) tf_executor.fetch %po#0, %po#1 : tensor<i32>, tensor<i32> } return %0#0, %0#1 : tensor<i32>, tensor<i32> } // -----
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Tue May 07 06:51:01 UTC 2024 - 15.7K bytes - Viewed (0) -
security/pkg/server/ca/node_auth_test.go
func toPod(p pod, isZtunnel bool) *v1.Pod { po := &v1.Pod{ ObjectMeta: metav1.ObjectMeta{ Name: p.name, Namespace: p.namespace, UID: types.UID(p.uid), }, Spec: v1.PodSpec{ ServiceAccountName: p.account, NodeName: p.node, }, } if isZtunnel { po.Labels = map[string]string{ "app": "ztunnel", } } return po }
Registered: Fri Jun 14 15:00:06 UTC 2024 - Last Modified: Wed Feb 28 16:41:38 UTC 2024 - 10.5K bytes - Viewed (0) -
docs/pl/docs/tutorial/first-steps.md
Polecenie `uvicorn main:app` odnosi się do: * `main`: plik `main.py` ("moduł" Python). * `app`: obiekt utworzony w pliku `main.py` w lini `app = FastAPI()`. * `--reload`: sprawia, że serwer uruchamia się ponownie po zmianie kodu. Używany tylko w trakcie tworzenia oprogramowania. Na wyjściu znajduje się linia z czymś w rodzaju: ```hl_lines="4" INFO: Uvicorn running on http://127.0.0.1:8000 (Press CTRL+C to quit) ```
Registered: Mon Jun 17 08:32:26 UTC 2024 - Last Modified: Thu Apr 18 19:53:19 UTC 2024 - 9.8K bytes - Viewed (0) -
staging/src/k8s.io/apiserver/pkg/endpoints/installer_test.go
}{ { name: "Basic Test", resources: []metav1.APIResource{ { Name: "pods", Namespaced: true, Kind: "Pod", ShortNames: []string{"po"}, Verbs: []string{"create", "delete", "deletecollection", "get", "list", "patch", "update", "watch"}, }, }, wantAPIResourceDiscovery: []apidiscoveryv2.APIResourceDiscovery{ {
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Fri Mar 01 18:15:22 UTC 2024 - 12.5K bytes - Viewed (0) -
src/cmd/compile/internal/ssa/loopreschedchecks.go
return } lastMems := findLastMems(f) idom := f.Idom() po := f.postorder() // The ordering in the dominator tree matters; it's important that // the walk of the dominator tree also be a preorder (i.e., a node is // visited only after all its non-backedge predecessors have been visited). sdom := newSparseOrderedTree(f, idom, po) if f.pass.debug > 1 {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Aug 22 21:17:10 UTC 2023 - 16K bytes - Viewed (0) -
src/image/jpeg/reader.go
for y := bounds.Min.Y; y < bounds.Max.Y; y++ { po := img.PixOffset(bounds.Min.X, y) yo := d.img3.YOffset(bounds.Min.X, y) co := d.img3.COffset(bounds.Min.X, y) for i, iMax := 0, bounds.Max.X-bounds.Min.X; i < iMax; i++ { img.Pix[po+4*i+0] = d.img3.Y[yo+i] img.Pix[po+4*i+1] = d.img3.Cb[co+i/cScale] img.Pix[po+4*i+2] = d.img3.Cr[co+i/cScale] img.Pix[po+4*i+3] = 255 } } return img, nil }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Oct 19 12:02:45 UTC 2023 - 22.5K bytes - Viewed (0)