Search Options

Results per page
Sort
Preferred Languages
Advance

Results 41 - 45 of 45 for worse (0.04 sec)

  1. okhttp-idna-mapping-table/src/main/resources/okhttp3/internal/idna/IdnaMappingTable.txt

    2FB9          ; mapped                 ; 9999          # 3.0  KANGXI RADICAL FRAGRANT
    2FBA          ; mapped                 ; 99AC          # 3.0  KANGXI RADICAL HORSE
    2FBB          ; mapped                 ; 9AA8          # 3.0  KANGXI RADICAL BONE
    2FBC          ; mapped                 ; 9AD8          # 3.0  KANGXI RADICAL TALL
    Registered: Fri Sep 05 11:42:10 UTC 2025
    - Last Modified: Sat Feb 10 11:25:47 UTC 2024
    - 854.1K bytes
    - Viewed (0)
  2. CHANGELOG/CHANGELOG-1.29.md

    - The scheduling queue didn't notice any extenders' failures, it could miss some cluster events,
      and it could end up Pods rejected by Extenders stuck in unschedulable pod pool in 5min in the worst-case scenario.
    Registered: Fri Sep 05 09:05:11 UTC 2025
    - Last Modified: Wed Mar 12 00:36:01 UTC 2025
    - 429.6K bytes
    - Viewed (1)
  3. CHANGELOG/CHANGELOG-1.28.md

    - The scheduling queue didn't notice any extenders' failures, it could miss some cluster events,
      and it could end up Pods rejected by Extenders stuck in unschedulable pod pool in 5min in the worst-case scenario.
    Registered: Fri Sep 05 09:05:11 UTC 2025
    - Last Modified: Wed Oct 23 20:13:20 UTC 2024
    - 456.9K bytes
    - Viewed (1)
  4. CHANGELOG/CHANGELOG-1.26.md

    - The scheduling queue didn't notice any extenders' failures, it could miss some cluster events,
      and it could end up Pods rejected by Extenders stuck in unschedulable pod pool in 5min in the worst-case scenario.
    Registered: Fri Sep 05 09:05:11 UTC 2025
    - Last Modified: Thu Mar 14 16:24:51 UTC 2024
    - 425.7K bytes
    - Viewed (0)
  5. lib/fips140/v1.0.0.zip

    186-5, Section 6.4.1, point 2 and Section 6.4.2, point 3. func hashToNat[P Point[P]](c *Curve[P], e *bigmod.Nat, hash []byte) { // ECDSA asks us to take the left-most log2(N) bits of hash, and use them as // an integer modulo N. This is the absolute worst of all worlds: we still // have to reduce, because the result might still overflow N, but to take // the left-most bits for P-521 we have to do a right shift. if size := c.N.Size(); len(hash) >= size { hash = hash[:size] if excess := len(hash)*8 -...
    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