- Sort Score
- Result 10 results
- Languages All
Results 251 - 259 of 259 for closing (0.09 sec)
-
CHANGELOG/CHANGELOG-1.27.md
- Fixes creationTimestamp: null causing unnecessary writes to etcd ([#116865](https://github.com/kubernetes/kubernetes/pull/116865), [@alexzielenski](https://github.com/alexzielenski)) [SIG API Machinery and Testing]
Registered: Fri Sep 05 09:05:11 UTC 2025 - Last Modified: Wed Jul 17 07:48:22 UTC 2024 - 466.3K bytes - Viewed (2) -
CHANGELOG/CHANGELOG-1.25.md
- Fixes creationTimestamp: null causing unnecessary writes to etcd ([#116865](https://github.com/kubernetes/kubernetes/pull/116865), [@alexzielenski](https://github.com/alexzielenski)) [SIG API Machinery and Testing]
Registered: Fri Sep 05 09:05:11 UTC 2025 - Last Modified: Mon May 06 09:23:20 UTC 2024 - 419.1K bytes - Viewed (0) -
CHANGELOG/CHANGELOG-1.11.md
* Update Cluster Autoscaler to version 1.3.7. ([#74136](https://github.com/kubernetes/kubernetes/pull/74136), [@jkaniuk](https://github.com/jkaniuk)) * Fix watch to not send the same set of events multiple times causing watcher to go back in time ([#73845](https://github.com/kubernetes/kubernetes/pull/73845), [@wojtek-t](https://github.com/wojtek-t))
Registered: Fri Sep 05 09:05:11 UTC 2025 - Last Modified: Thu Feb 06 06:04:15 UTC 2020 - 328.4K bytes - Viewed (0) -
CHANGELOG/CHANGELOG-1.29.md
### Bug or Regression - Fix a scheduler preemption issue where the victim pod was not deleted due to incorrect status patching. This issue occurred when the preemptor and victim pods had different QoS classes in their status, causing the preemption to fail entirely. ([#126694](https://github.com/kubernetes/kubernetes/pull/126694), [@Huang-Wei](https://github.com/Huang-Wei)) [SIG Scheduling]
Registered: Fri Sep 05 09:05:11 UTC 2025 - Last Modified: Wed Mar 12 00:36:01 UTC 2025 - 429.6K bytes - Viewed (1) -
CHANGELOG/CHANGELOG-1.33.md
## Changelog since v1.33.2 ## Changes by Kind ### Bug or Regression - Fix a bug causing unexpected delay of creating pods for newly created jobs ([#132158](https://github.com/kubernetes/kubernetes/pull/132158), [@linxiulei](https://github.com/linxiulei)) [SIG Apps and Testing]
Registered: Fri Sep 05 09:05:11 UTC 2025 - Last Modified: Wed Aug 13 19:46:23 UTC 2025 - 294.3K bytes - Viewed (0) -
CHANGELOG/CHANGELOG-1.34.md
- Fix a bug causing unexpected delay of creating pods for newly created jobs ([#132109](https://github.com/kubernetes/kubernetes/pull/132109), [@linxiulei](https://github.com/linxiulei)) [SIG Apps and Testing]
Registered: Fri Sep 05 09:05:11 UTC 2025 - Last Modified: Wed Aug 27 10:36:10 UTC 2025 - 292.8K bytes - Viewed (1) -
CREDITS
to choose that version for the Program. Later license versions may give you additional or different permissions. However, no additional obligations are imposed on any author or copyright holder as a result of your choosing to follow a later version. 15. Disclaimer of Warranty. THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY APPLICABLE LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT
Registered: Sun Sep 07 19:28:11 UTC 2025 - Last Modified: Thu Mar 13 05:29:51 UTC 2025 - 1.8M bytes - Viewed (0) -
CHANGELOG/CHANGELOG-1.30.md
### Bug or Regression - Fix a scheduler preemption issue where the victim pod was not deleted due to incorrect status patching. This issue occurred when the preemptor and victim pods had different QoS classes in their status, causing the preemption to fail entirely. ([#126693](https://github.com/kubernetes/kubernetes/pull/126693), [@Huang-Wei](https://github.com/Huang-Wei)) [SIG Scheduling]
Registered: Fri Sep 05 09:05:11 UTC 2025 - Last Modified: Wed Jun 18 18:59:10 UTC 2025 - 398.1K bytes - Viewed (0) -
lib/fips140/v1.0.0.zip
is large // enough to justify the cost of the multiplications. // The threshold is selected experimentally as a linear function of n. threshold := n / 4 // We calculate how many of the most-significant bits of the exponent we can // compute before crossing the threshold, and we do it with doublings. i := bits.UintSize for logR>>i <= threshold { i-- } for k := uint(0); k < logR>>i; k++ { rr.Add(rr, m) } // Then we process the remaining bits of the exponent with a // square-and-double chain. for i >...
Registered: Tue Sep 09 11:13:09 UTC 2025 - Last Modified: Wed Jan 29 15:10:35 UTC 2025 - 635K bytes - Viewed (0)