- Sort Score
- Num 10 results
- Language All
Results 41 - 50 of 50 for refactored (0.13 seconds)
-
CHANGELOG/CHANGELOG-1.6.md
* Add authorization mode to kubeadm ([#39846](https://github.com/kubernetes/kubernetes/pull/39846), [@andrewrynhard](https://github.com/andrewrynhard)) * Refactor the certificate and kubeconfig code in the kubeadm binary into two phases ([#39280](https://github.com/kubernetes/kubernetes/pull/39280), [@luxas](https://github.com/luxas))
Created: Fri Dec 26 09:05:12 GMT 2025 - Last Modified: Thu Dec 24 02:28:26 GMT 2020 - 304K bytes - Click Count (0) -
CHANGELOG/CHANGELOG-1.31.md
- Finished initial generic controlplane refactor of kube-apiserver, providing a sample binary building a Kubernetes-like control plane, but without container orchestration resources. ([#124530](https://github.com/kubernetes/kubernetes/pull/124530), [@sttts](https://github.com/sttts)) [SIG API Machinery,...
Created: Fri Dec 26 09:05:12 GMT 2025 - Last Modified: Wed Nov 12 11:33:21 GMT 2025 - 451.9K bytes - Click Count (0) -
CHANGELOG/CHANGELOG-1.15.md
* Add support for Azure File plugin to csi-translation-lib ([#78356](https://github.com/kubernetes/kubernetes/pull/78356), [@andyzhangx](https://github.com/andyzhangx)) * refactor AWS NLB securityGroup handling ([#74692](https://github.com/kubernetes/kubernetes/pull/74692), [@M00nF1sh](https://github.com/M00nF1sh))
Created: Fri Dec 26 09:05:12 GMT 2025 - Last Modified: Thu May 05 13:44:43 GMT 2022 - 278.9K bytes - Click Count (0) -
CHANGELOG/CHANGELOG-1.7.md
## Changelog since v1.7.0-alpha.2 ### Action Required * Refactor kube-proxy configuration ([#34727](https://github.com/kubernetes/kubernetes/pull/34727), [@ncdc](https://github.com/ncdc)) ### Other notable changes
Created: Fri Dec 26 09:05:12 GMT 2025 - Last Modified: Thu May 05 13:44:43 GMT 2022 - 308.7K bytes - Click Count (1) -
CHANGELOG/CHANGELOG-1.8.md
* kubeadm: Implementing the controlplane phase ([#50302](https://github.com/kubernetes/kubernetes/pull/50302), [@fabriziopandini](https://github.com/fabriziopandini)) * Refactor addons into multiple packages ([#50214](https://github.com/kubernetes/kubernetes/pull/50214), [@andrewrynhard](https://github.com/andrewrynhard))
Created: Fri Dec 26 09:05:12 GMT 2025 - Last Modified: Tue Feb 20 15:45:02 GMT 2024 - 312.2K bytes - Click Count (0) -
CHANGELOG/CHANGELOG-1.9.md
* Refactor kube-scheduler configuration ([#52428](https://github.com/kubernetes/kubernetes/pull/52428))
Created: Fri Dec 26 09:05:12 GMT 2025 - Last Modified: Tue Nov 16 10:46:27 GMT 2021 - 313.7K bytes - Click Count (0) -
CHANGELOG/CHANGELOG-1.24.md
- Migrate statefulset files to structured logging ([#106109](https://github.com/kubernetes/kubernetes/pull/106109), [@h4ghhh](https://github.com/h4ghhh))
Created: Fri Dec 26 09:05:12 GMT 2025 - Last Modified: Thu Aug 24 00:02:43 GMT 2023 - 473.4K bytes - Click Count (0) -
CHANGELOG/CHANGELOG-1.19.md
- Reduce event spam during a volume operation error. ([#89794](https://github.com/kubernetes/kubernetes/pull/89794), [@msau42](https://github.com/msau42)) [SIG Storage] - Refactor the local nodeipam range allocator and instrument the cidrset used to store the allocated CIDRs with the following metrics: "cidrset_cidrs_allocations_total", "cidrset_cidrs_releases_total", "cidrset_usage_cidrs",
Created: Fri Dec 26 09:05:12 GMT 2025 - Last Modified: Wed Jan 05 05:42:32 GMT 2022 - 489.7K bytes - Click Count (0) -
lib/fips140/v1.0.0-c2097c7c.zip
bigmod.NewNat().Mod(q.Nat(), p) } if qP.Mul(priv.qInv, p).IsOne() != 1 { return errors.New("crypto/rsa: invalid CRT coefficient") } // Check that |p - q| > 2^(nlen/2 - 100). // // If p and q are very close to each other, then N=pq can be trivially // factored using Fermat's factorization method. Broken RSA implementations // do generate such keys. See Hanno Böck, Fermat Factorization in the Wild, // https://eprint.iacr.org/2023/026.pdf. diff := bigmod.NewNat() if qP, err := bigmod.NewNat().SetBytes(q.Nat().Bytes(q),...
Created: Tue Dec 30 11:13:12 GMT 2025 - Last Modified: Thu Sep 25 19:53:19 GMT 2025 - 642.7K bytes - Click Count (0) -
lib/fips140/v1.1.0-rc1.zip
dP") } dQ1 := bigmod.NewNat().Mod(priv.d, qMinus1) if dQ1.Equal(dQ) != 1 { return errors.New("crypto/rsa: d does not match dQ") } // Check that |p - q| > 2^(nlen/2 - 100). // // If p and q are very close to each other, then N=pq can be trivially // factored using Fermat's factorization method. Broken RSA implementations // do generate such keys. See Hanno Böck, Fermat Factorization in the Wild, // https://eprint.iacr.org/2023/026.pdf. diff := bigmod.NewNat() if qP, err := bigmod.NewNat().SetBytes(q.Nat().Bytes(q),...
Created: Tue Dec 30 11:13:12 GMT 2025 - Last Modified: Thu Dec 11 16:27:41 GMT 2025 - 663K bytes - Click Count (0)