Search Options

Display Count
Sort
Preferred Language
Advanced Search

Results 1 - 6 of 6 for to (0.05 seconds)

  1. lib/fips140/v1.0.0-c2097c7c.zip

    mLen := uint(m.BitLen()) logR := _W * n // We start by computing R = 2^(_W * n) mod m. We can get pretty close, to // 2^⌊log₂m⌋, by setting the highest bit we can without having to reduce. rr.limbs[n-1] = 1 << ((mLen - 1) % _W) // Then we double until we reach 2^(_W * n). for i := mLen - 1; i < logR; i++ { rr.Add(rr, m) } // Next we need to get from R to 2^(_W * n) R mod m (aka from one to R in // the Montgomery domain, meaning we can use Montgomery multiplication now). // We could do that by doubling...
    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)
  2. RELEASE.md

    *  Added `keras.utils.TimedThread` utility to run a timed thread every x seconds. It can be used to run a threaded function alongside model training or any other snippet of code.
    Created: Tue Dec 30 12:39:10 GMT 2025
    - Last Modified: Tue Oct 28 22:27:41 GMT 2025
    - 740.4K bytes
    - Click Count (3)
  3. CHANGELOG/CHANGELOG-1.19.md

        - [Ingress graduates to General Availability](#ingress-graduates-to-general-availability)
        - [seccomp graduates to General Availability](#seccomp-graduates-to-general-availability)
        - [Production images moved to community control](#production-images-moved-to-community-control)
        - [KubeSchedulerConfiguration graduates to Beta](#kubeschedulerconfiguration-graduates-to-beta)
    Created: Fri Dec 26 09:05:12 GMT 2025
    - Last Modified: Wed Jan 05 05:42:32 GMT 2022
    - 489.7K bytes
    - Click Count (0)
  4. docs/en/docs/release-notes.md

    * 🔥 Remove inactive/scarce translations to Vietnamese. PR [#14543](https://github.com/fastapi/fastapi/pull/14543) by [@tiangolo](https://github.com/tiangolo).
    * 🔥 Remove inactive/scarce translations to Persian. PR [#14542](https://github.com/fastapi/fastapi/pull/14542) by [@tiangolo](https://github.com/tiangolo).
    Created: Sun Dec 28 07:19:09 GMT 2025
    - Last Modified: Sat Dec 27 19:06:15 GMT 2025
    - 586.7K bytes
    - Click Count (0)
  5. lib/fips140/v1.1.0-rc1.zip

    mLen := uint(m.BitLen()) logR := _W * n // We start by computing R = 2^(_W * n) mod m. We can get pretty close, to // 2^⌊log₂m⌋, by setting the highest bit we can without having to reduce. rr.limbs[n-1] = 1 << ((mLen - 1) % _W) // Then we double until we reach 2^(_W * n). for i := mLen - 1; i < logR; i++ { rr.Add(rr, m) } // Next we need to get from R to 2^(_W * n) R mod m (aka from one to R in // the Montgomery domain, meaning we can use Montgomery multiplication now). // We could do that by doubling...
    Created: Tue Dec 30 11:13:12 GMT 2025
    - Last Modified: Thu Dec 11 16:27:41 GMT 2025
    - 663K bytes
    - Click Count (0)
  6. okhttp-idna-mapping-table/src/main/resources/okhttp3/internal/idna/IdnaMappingTable.txt

    200C..200D    ; deviation              ;               # 1.1  ZERO WIDTH NON-JOINER..ZERO WIDTH JOINER
    200E..200F    ; disallowed                             # 1.1  LEFT-TO-RIGHT MARK..RIGHT-TO-LEFT MARK
    2010          ; valid                  ;      ; NV8    # 1.1  HYPHEN
    2011          ; mapped                 ; 2010          # 1.1  NON-BREAKING HYPHEN
    Created: Fri Dec 26 11:42:13 GMT 2025
    - Last Modified: Sat Feb 10 11:25:47 GMT 2024
    - 854.1K bytes
    - Click Count (0)
Back to Top