- Sort Score
- Result 10 results
- Languages All
Results 171 - 179 of 179 for Iterate (0.11 sec)
-
api/go1.txt
pkg go/token, method (*FileSet) AddFile(string, int, int) *File pkg go/token, method (*FileSet) Base() int pkg go/token, method (*FileSet) File(Pos) *File pkg go/token, method (*FileSet) Iterate(func(*File) bool) pkg go/token, method (*FileSet) Position(Pos) Position pkg go/token, method (*FileSet) Read(func(interface{}) error) error pkg go/token, method (*FileSet) Write(func(interface{}) error) error
Registered: Tue Dec 30 11:13:12 UTC 2025 - Last Modified: Wed Aug 14 18:58:28 UTC 2013 - 1.7M bytes - Viewed (0) -
CHANGELOG/CHANGELOG-1.33.md
- The Service trafficDistribution field, including the PreferClose option, has graduated to GA. Services that do not have the field configured will continue to operate with their existing behavior. Refer to the documentation https://kubernetes.io/docs/concepts/services-networking/service/#traffic-distribution
Registered: Fri Dec 26 09:05:12 UTC 2025 - Last Modified: Wed Dec 10 01:15:24 UTC 2025 - 334.8K bytes - Viewed (0) -
CHANGELOG/CHANGELOG-1.31.md
- The Service trafficDistribution field has graduated to beta and is now available for configuration by default, without the need to enable any feature flag. Services that do not have the field configured will continue to operate with their existing behavior. Refer to the documentation https://kubernetes.io/docs/concepts/services-networking/service/#traffic-distribution for more details. ([#125838](https://github.com/kubernetes/kubernetes/pull/125838), [@gauravkghildiyal]...
Registered: Fri Dec 26 09:05:12 UTC 2025 - Last Modified: Wed Nov 12 11:33:21 UTC 2025 - 451.9K bytes - Viewed (0) -
CREDITS
Library. A suitable mechanism is one that (a) uses at run time a copy of the Library already present on the user's computer system, and (b) will operate properly with a modified version of the Library that is interface-compatible with the Linked Version. e) Provide Installation Information, but only if you would otherwise
Registered: Sun Dec 28 19:28:13 UTC 2025 - Last Modified: Thu Mar 13 05:29:51 UTC 2025 - 1.8M bytes - Viewed (0) -
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.
Registered: Fri Dec 26 09:05:12 UTC 2025 - Last Modified: Tue Feb 20 15:45:02 UTC 2024 - 312.2K bytes - Viewed (0) -
CHANGELOG/CHANGELOG-1.9.md
### Node
Registered: Fri Dec 26 09:05:12 UTC 2025 - Last Modified: Tue Nov 16 10:46:27 UTC 2021 - 313.7K bytes - Viewed (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...
Registered: Fri Dec 26 09:05:12 UTC 2025 - Last Modified: Tue Dec 13 12:43:45 UTC 2022 - 454.1K bytes - Viewed (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...
Registered: Tue Dec 30 11:13:12 UTC 2025 - Last Modified: Thu Sep 25 19:53:19 UTC 2025 - 642.7K bytes - Viewed (0) -
lib/fips140/v1.1.0-rc1.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...
Registered: Tue Dec 30 11:13:12 UTC 2025 - Last Modified: Thu Dec 11 16:27:41 UTC 2025 - 663K bytes - Viewed (0)