Search Options

Display Count
Sort
Preferred Language
Advanced Search

Results 1 - 5 of 5 for deleting (0.1 seconds)

  1. CHANGELOG/CHANGELOG-1.19.md

        - make kube::util::find-binary return an error when it doesn't find
          anything so that hack scripts fail fast instead of with '' binary not
          found errors.
        - this required deleting some genfeddoc stuff. the binary no longer
          exists in k/k repo since we removed federation/, and I don't see it
          in https://github.com/kubernetes-sigs/kubefed/ either. I'm assuming
          that it's gone for good now.
    Created: Fri Apr 03 09:05:14 GMT 2026
    - Last Modified: Wed Jan 05 05:42:32 GMT 2022
    - 489.7K bytes
    - Click Count (0)
  2. RELEASE.md

        *   Fix regression in deterministic selection of deterministic cuDNN
            convolution algorithms, a regression that was introduced in v2.5. Note
            that nondeterministic out-of-memory events while selecting algorithms
            could still lead to nondeterminism, although this is very unlikely. This
            additional, unlikely source will be eliminated in a later version.
        *   Add deterministic GPU implementations of:
    Created: Tue Apr 07 12:39:13 GMT 2026
    - Last Modified: Mon Mar 30 18:31:38 GMT 2026
    - 746.5K bytes
    - Click Count (3)
  3. okhttp-idna-mapping-table/src/main/resources/okhttp3/internal/idna/IdnaMappingTable.txt

    1DFA          ; valid                                  # 14.0 COMBINING DOT BELOW LEFT
    1DFB          ; valid                                  # 9.0  COMBINING DELETION MARK
    1DFC          ; valid                                  # 6.0  COMBINING DOUBLE INVERTED BREVE BELOW
    1DFD          ; valid                                  # 5.2  COMBINING ALMOST EQUAL TO BELOW
    Created: Fri Apr 03 11:42:14 GMT 2026
    - Last Modified: Sat Feb 10 11:25:47 GMT 2024
    - 854.1K bytes
    - Click Count (0)
  4. lib/fips140/v1.26.0.zip

    then return // x + 1. Note that it follows that 0 < x + 1 < N. Instead, SetBytes // checks that k < N, and we explicitly check 0 != k. Since k can't be // negative, this is strictly equivalent. None of this matters anyway // because the chance of selecting zero is cryptographically negligible. if k, err := bigmod.NewNat().SetBytes(b, c.N); err == nil && k.IsZero() == 0 { p, err := c.newPoint().ScalarBaseMult(k.Bytes(c.N)) return k, p, err } if testingOnlyRejection != nil { testingOnlyRejection() }...
    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)
  5. lib/fips140/v1.0.0-c2097c7c.zip

    then return // x + 1. Note that it follows that 0 < x + 1 < N. Instead, SetBytes // checks that k < N, and we explicitly check 0 != k. Since k can't be // negative, this is strictly equivalent. None of this matters anyway // because the chance of selecting zero is cryptographically negligible. if k, err := bigmod.NewNat().SetBytes(b, c.N); err == nil && k.IsZero() == 0 { p, err := c.newPoint().ScalarBaseMult(k.Bytes(c.N)) return k, p, err } if testingOnlyRejection != nil { testingOnlyRejection() }...
    Created: Tue Apr 07 11:13:11 GMT 2026
    - Last Modified: Thu Sep 25 19:53:19 GMT 2025
    - 642.7K bytes
    - Click Count (0)
Back to Top