- Sort Score
- Num 10 results
- Language All
Results 221 - 225 of 225 for tooling (0.09 seconds)
The search processing time has exceeded the limit. The displayed results may be partial.
-
CHANGELOG/CHANGELOG-1.8.md
* The `batch/v2alpha1.ScheduledJob` was removed. Migrate to `batch/v1beta.CronJob` to continue managing time based jobs.
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.33.md
## Changelog since v1.33.7 ## Changes by Kind ### Feature - Kubeadm: when patching a Node object do not exit early on unknown (non-allowlisted) API errors. Instead, always retry within the duration of the polling for getting and patching a Node object. ([#136070](https://github.com/kubernetes/kubernetes/pull/136070), [@neolit123](https://github.com/neolit123)) [SIG Cluster Lifecycle]
Created: Fri Apr 03 09:05:14 GMT 2026 - Last Modified: Thu Mar 19 03:17:58 GMT 2026 - 369K bytes - Click Count (0) -
CHANGELOG/CHANGELOG-1.34.md
## Changelog since v1.34.3 ## Changes by Kind ### Feature - Kubeadm: when patching a Node object do not exit early on unknown (non-allowlisted) API errors. Instead, always retry within the duration of the polling for getting and patching a Node object. ([#136071](https://github.com/kubernetes/kubernetes/pull/136071), [@neolit123](https://github.com/neolit123)) [SIG Cluster Lifecycle]
Created: Fri Apr 03 09:05:14 GMT 2026 - Last Modified: Thu Mar 19 03:19:43 GMT 2026 - 368.7K bytes - Click Count (2) -
CHANGELOG/CHANGELOG-1.32.md
## Changelog since v1.32.11 ## Changes by Kind ### Feature - Kubeadm: when patching a Node object do not exit early on unknown (non-allowlisted) API errors. Instead, always retry within the duration of the polling for getting and patching a Node object. ([#136069](https://github.com/kubernetes/kubernetes/pull/136069), [@neolit123](https://github.com/neolit123)) [SIG Cluster Lifecycle]
Created: Fri Apr 03 09:05:14 GMT 2026 - Last Modified: Thu Feb 26 23:58:21 GMT 2026 - 470.5K bytes - Click Count (0) -
lib/fips140/v1.26.0.zip
In J. Kilian, editor, Advances in Cryptology. lHash2Good := subtle.ConstantTimeCompare(lHash, lHash2) // The remainder of the plaintext must be zero or more 0x00, followed // by 0x01, followed by the message. // lookingForIndex: 1 iff we are still looking for the 0x01 // index: the offset of the first 0x01 byte // invalid: 1 iff we saw a non-zero byte before the 0x01. var lookingForIndex, index, invalid int lookingForIndex = 1 rest := db[hash.Size():] for i := 0; i < len(rest); i++ { equals0 := co...
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)