- Sort Score
- Num 10 results
- Language All
Results 411 - 416 of 416 for broker (0.15 seconds)
-
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.21.md
- Kubeadm: during execution of the "check expiration" command, treat the etcd CA as external if there is a missing etcd CA key file (etcd/ca.key) and perform the proper validation on certificates signed by the etcd CA. Additionally, make sure that the CA for all entries in the output table is included - for both certificates on disk and in kubeconfig files. ([#106924](https://github.com/kubernetes/kubernetes/pull/106924),...
Created: Fri Dec 26 09:05:12 GMT 2025 - Last Modified: Fri Oct 14 07:03:14 GMT 2022 - 367.3K 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) -
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) -
CHANGELOG/CHANGELOG-1.28.md
- Revert kubelet prober metrics `pod` tag to include actual pod name ([#118549](https://github.com/kubernetes/kubernetes/pull/118549), [@a7i](https://github.com/a7i)) [SIG Node]
Created: Fri Dec 26 09:05:12 GMT 2025 - Last Modified: Fri Sep 05 03:47:18 GMT 2025 - 456.9K bytes - Click Count (1) -
CREDITS
OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. ================================================================ github.com/pkg/browser https://github.com/pkg/browser ---------------------------------------------------------------- Copyright (c) 2014, Dave Cheney <******@****.***> All rights reserved.
Created: Sun Dec 28 19:28:13 GMT 2025 - Last Modified: Thu Mar 13 05:29:51 GMT 2025 - 1.8M bytes - Click Count (0)