Search Options

Display Count
Sort
Preferred Language
Advanced Search

Results 111 - 114 of 114 for frames (0.08 seconds)

  1. doc/go_spec.html

    arguments must be identifiers denoting the type parameters being declared, one
    for each type parameter of the receiver base type.
    The type parameter names do not need to match their corresponding parameter names in the
    receiver base type definition, and all non-blank parameter names must be unique in the
    receiver parameter section and the method signature.
    The receiver type parameter constraints are implied by the receiver base type definition:
    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)
  2. CHANGELOG/CHANGELOG-1.22.md

    `apiserver_webhooks_x509_missing_san_total`. This metric measures a number of connections to webhooks/aggregated API servers that use certificates without Subject Alternative Names. It being non-zero is a warning sign that these connections will stop functioning in the future since Golang is going to deprecate x509 certificate subject Common Names for server hostname verification. ([#95396](https://github.com/kubernetes/kubernetes/pull/95396), [@stlaz](https://github.com/stlaz)) [SIG API Machinery, Auth and...
    Created: Fri Dec 26 09:05:12 GMT 2025
    - Last Modified: Tue Dec 13 12:43:45 GMT 2022
    - 454.1K bytes
    - Click Count (0)
  3. lib/fips140/v1.0.0-c2097c7c.zip

    millerRabinSetup(w) if err != nil { // w is zero, one, or even. return false } primes, err := bigmod.NewNat().SetBytes(productOfPrimes, mr.w) // If w is too small for productOfPrimes, key generation is // going to be fast enough anyway. if err == nil { _, hasInverse := primes.InverseVarTime(primes, mr.w) if !hasInverse { // productOfPrimes doesn't have an inverse mod w, // so w is divisible by at least one of the primes. return false } } // iterations is the number of Miller-Rabin rounds, each with...
    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)
  4. lib/fips140/v1.1.0-rc1.zip

    return false } iterations-- if iterations == 0 { return true } } } // primes are the first prime numbers (except 2), such that the product of any // three primes fits in a uint32. // // More primes cause fewer Miller-Rabin tests of composites (nothing can help // with the final test on the actual prime) but have diminishing returns: these // 255 primes catch 84.9% of composites, the next 255 would catch 1.5% more. // Adding primes can still be marginally useful since they only compete with the // (much...
    Created: Tue Dec 30 11:13:12 GMT 2025
    - Last Modified: Thu Dec 11 16:27:41 GMT 2025
    - 663K bytes
    - Click Count (0)
Back to Top