Search Options

Results per page
Sort
Preferred Languages
Advance

Results 1 - 4 of 4 for deleting (0.09 sec)

  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.
    Registered: Fri Sep 05 09:05:11 UTC 2025
    - Last Modified: Wed Jan 05 05:42:32 UTC 2022
    - 489.7K bytes
    - Viewed (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:
    Registered: Tue Sep 09 12:39:10 UTC 2025
    - Last Modified: Mon Aug 18 20:54:38 UTC 2025
    - 740K bytes
    - Viewed (2)
  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
    Registered: Fri Sep 05 11:42:10 UTC 2025
    - Last Modified: Sat Feb 10 11:25:47 UTC 2024
    - 854.1K bytes
    - Viewed (0)
  4. lib/fips140/v1.0.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() }...
    Registered: Tue Sep 09 11:13:09 UTC 2025
    - Last Modified: Wed Jan 29 15:10:35 UTC 2025
    - 635K bytes
    - Viewed (0)
Back to top