- Sort Score
- Num 10 results
- Language All
Results 211 - 215 of 215 for Iterate (0.15 seconds)
-
CHANGELOG/CHANGELOG-1.8.md
[Sig API Machinery]: https://github.com/kubernetes/community/tree/master/sig-api-machinery ### SIG Apps [SIG Apps][] focuses on the Kubernetes APIs and the external tools that are required to deploy and operate Kubernetes workloads.
Created: Fri Apr 03 09:05:14 GMT 2026 - Last Modified: Tue Feb 20 15:45:02 GMT 2024 - 312.2K bytes - Click Count (0) -
CHANGELOG/CHANGELOG-1.9.md
### Node
Created: Fri Apr 03 09:05:14 GMT 2026 - Last Modified: Tue Nov 16 10:46:27 GMT 2021 - 313.7K bytes - Click Count (0) -
CHANGELOG/CHANGELOG-1.22.md
kubeadm-specific `RootlessControlPlane` feature gate. When you deploy a cluster using this alpha feature, your control plane runs with lower privileges. A new [v1beta3 configuration API](https://github.com/kubernetes/kubeadm/issues/1796). It [iterates over v1beta2](https://pkg.go.dev/k8s.io/kubernetes/cmd/kubeadm/app/apis/kubeadm/v1beta3) by adding some long requested features and deprecating some existing ones. The `V1beta3` is now the preferred API version; the `v1beta2` API also remains available...
Created: Fri Apr 03 09:05:14 GMT 2026 - Last Modified: Tue Dec 13 12:43:45 GMT 2022 - 454.1K bytes - Click Count (0) -
lib/fips140/v1.0.0-c2097c7c.zip
1 is computed during the next loop. This is // possible because each iteration only uses T[i] in Step 2 and then // discards it in Step 6. d := bLimbs[i] c1 := addMulVVW(T[i:n+i], aLimbs, d) // Step 6 is replaced by shifting the virtual window we operate // over: T of the algorithm is T[i:] for us. That means that T1 in // Step 2 (T mod 2^_W) is simply T[i]. k0 in Step 3 is our m0inv. Y := T[i] * m.m0inv // Step 4 and 5 add Y × m to T, which as mentioned above is stored // at T[i:]. The two carries...
Created: Tue Apr 07 11:13:11 GMT 2026 - Last Modified: Thu Sep 25 19:53:19 GMT 2025 - 642.7K bytes - Click Count (0) -
lib/fips140/v1.26.0.zip
1 is computed during the next loop. This is // possible because each iteration only uses T[i] in Step 2 and then // discards it in Step 6. d := bLimbs[i] c1 := addMulVVW(T[i:n+i], aLimbs, d) // Step 6 is replaced by shifting the virtual window we operate // over: T of the algorithm is T[i:] for us. That means that T1 in // Step 2 (T mod 2^_W) is simply T[i]. k0 in Step 3 is our m0inv. Y := T[i] * m.m0inv // Step 4 and 5 add Y × m to T, which as mentioned above is stored // at T[i:]. The two carries...
Created: Tue Apr 07 11:13:11 GMT 2026 - Last Modified: Thu Jan 08 17:58:32 GMT 2026 - 660.3K bytes - Click Count (0)