- Sort Score
- Num 10 results
- Language All
Results 91 - 100 of 102 for broke (0.09 seconds)
The search processing time has exceeded the limit. The displayed results may be partial.
-
CHANGELOG/CHANGELOG-1.16.md
- Generating informers for packages in directories containing dots in their name is broken. This will be fixed in v1.16.1. ([#82860](https://github.com/kubernetes/kubernetes/issues/82860))
Created: Fri Dec 26 09:05:12 GMT 2025 - Last Modified: Wed Oct 23 20:13:20 GMT 2024 - 345.2K bytes - Click Count (0) -
CHANGELOG/CHANGELOG-1.20.md
- Fix: azure disk resize error if source does not exist ([#93011](https://github.com/kubernetes/kubernetes/pull/93011), [@andyzhangx](https://github.com/andyzhangx)) [SIG Cloud Provider] - Fix: detach azure disk broken on Azure Stack ([#94885](https://github.com/kubernetes/kubernetes/pull/94885), [@andyzhangx](https://github.com/andyzhangx)) [SIG Cloud Provider]
Created: Fri Dec 26 09:05:12 GMT 2025 - Last Modified: Wed Jan 19 21:05:45 GMT 2022 - 409K bytes - Click Count (0) -
CHANGELOG/CHANGELOG-1.17.md
- Fix: detach azure disk broken on Azure Stack ([#94885](https://github.com/kubernetes/kubernetes/pull/94885), [@andyzhangx](https://github.com/andyzhangx)) [SIG Cloud Provider]
Created: Fri Dec 26 09:05:12 GMT 2025 - Last Modified: Thu Jan 28 10:44:33 GMT 2021 - 346.2K bytes - Click Count (1) -
CHANGELOG/CHANGELOG-1.19.md
- Fix: azure disk resize error if source does not exist ([#93011](https://github.com/kubernetes/kubernetes/pull/93011), [@andyzhangx](https://github.com/andyzhangx)) [SIG Cloud Provider] - Fix: detach azure disk broken on Azure Stack ([#94885](https://github.com/kubernetes/kubernetes/pull/94885), [@andyzhangx](https://github.com/andyzhangx)) [SIG Cloud Provider]
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) -
doc/go_spec.html
<p> The formal syntax uses semicolons <code>";"</code> as terminators in a number of productions. Go programs may omit most of these semicolons using the following two rules: </p> <ol> <li> When the input is broken into tokens, a semicolon is automatically inserted into the token stream immediately after a line's final token if that token is <ul> <li>an <a href="#Identifiers">identifier</a> </li> <li>an
Created: Tue Dec 30 11:13:12 GMT 2025 - Last Modified: Tue Dec 02 23:07:19 GMT 2025 - 286.5K bytes - Click Count (1) -
CHANGELOG/CHANGELOG-1.25.md
- Kubelet: fix GetAllocatableCPUs method in cpumanager ([#113420](https://github.com/kubernetes/kubernetes/pull/113420), [@Garrybest](https://github.com/Garrybest)) [SIG Node] - Pod logs using --timestamps are not broken up with timestamps anymore. ([#113515](https://github.com/kubernetes/kubernetes/pull/113515), [@rphillips](https://github.com/rphillips)) [SIG Node] ## Dependencies ### Added _Nothing has changed._
Created: Fri Dec 26 09:05:12 GMT 2025 - Last Modified: Mon May 06 09:23:20 GMT 2024 - 419.1K bytes - Click Count (0) -
lib/fips140/v1.0.0-c2097c7c.zip
suggests in Section 4 that we can do an "Almost Montgomery // Multiplication" by subtracting only in the overflow case, but the // cost is very similar since the constant time subtraction tells us if // x >= m as a side effect, and taking care of the broken invariant is // highly undesirable (see https://go.dev/issue/13907). copy(x.reset(n).limbs, T[n:]) x.maybeSubtractModulus(choice(c), m) // The following specialized cases follow the exact same algorithm, but // optimized for the sizes most used in...
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) -
RELEASE.md
zzpmiracle # Release 2.6.2 Fixes an issue where `keras`, `tensorflow_estimator` and `tensorboard` were missing proper upper bounds and resulted in broken installs after TF 2.7 release # Release 2.6.1 This release introduces several vulnerability fixes: * Fixes a code injection issue in `saved_model_cli`
Created: Tue Dec 30 12:39:10 GMT 2025 - Last Modified: Tue Oct 28 22:27:41 GMT 2025 - 740.4K bytes - Click Count (3) -
lib/fips140/v1.1.0-rc1.zip
suggests in Section 4 that we can do an "Almost Montgomery // Multiplication" by subtracting only in the overflow case, but the // cost is very similar since the constant time subtraction tells us if // x >= m as a side effect, and taking care of the broken invariant is // highly undesirable (see https://go.dev/issue/13907). copy(x.reset(n).limbs, T[n:]) x.maybeSubtractModulus(choice(c), m) // The following specialized cases follow the exact same algorithm, but // optimized for the sizes most used in...
Created: Tue Dec 30 11:13:12 GMT 2025 - Last Modified: Thu Dec 11 16:27:41 GMT 2025 - 663K bytes - Click Count (0) -
src/main/webapp/css/bootstrap.min.css.map
font-size(inherit);\n color: inherit;\n word-break: normal;\n }\n}\n\ncode {\n @include font-size($code-font-size);\n color: var(--#{$prefix}code-color);\n word-wrap: break-word;\n\n // Streamline the style when inside anchors to avoid broken underline and more\n a > & {\n color: inherit;\n }\n}\n\nkbd {\n padding: $kbd-padding-y $kbd-padding-x;\n @include font-size($kbd-font-size);\n color: $kbd-color;\n background-color: $kbd-bg;\n @include border-radius($border-radius-sm);\n\n...Created: Sat Dec 20 09:19:18 GMT 2025 - Last Modified: Sun Jan 12 06:14:02 GMT 2025 - 575.5K bytes - Click Count (0)