Search Options

Results per page
Sort
Preferred Languages
Advance

Results 1 - 4 of 4 for mentions (0.06 sec)

  1. docs/en/docs/release-notes.md

    * 📝 Update includes for `docs/en/docs/tutorial/body-updates.md`. PR [#12712](https://github.com/fastapi/fastapi/pull/12712) by [@davioc](https://github.com/davioc).
    * 📝 Remove mention of Celery in the project generators. PR [#12742](https://github.com/fastapi/fastapi/pull/12742) by [@david-caro](https://github.com/david-caro).
    Registered: Sun Sep 07 07:19:17 UTC 2025
    - Last Modified: Fri Sep 05 12:48:45 UTC 2025
    - 544.1K bytes
    - Viewed (0)
  2. CHANGELOG/CHANGELOG-1.19.md

    - No actions required. This is a small enhancement to a utility library. ([#92440](https://github.com/kubernetes/kubernetes/pull/92440), [@luigibk](https://github.com/luigibk)) [SIG Network]
    - PodTolerationRestriction: Mention Whitelist Scope in Error ([#87582](https://github.com/kubernetes/kubernetes/pull/87582), [@mrueg](https://github.com/mrueg)) [SIG Scheduling]
    Registered: Fri Sep 05 09:05:11 UTC 2025
    - Last Modified: Wed Jan 05 05:42:32 UTC 2022
    - 489.7K bytes
    - Viewed (0)
  3. RELEASE.md

            version is LLVM/clang 17. The official Wheels-published on PyPI will be
            based on Clang; however, users retain the option to build wheels using
            the MSVC compiler following the steps mentioned in
            https://www.tensorflow.org/install/source_windows as has been the case
            before
    
    ### Breaking Changes
    
    *   `tf.summary.trace_on` now takes a `profiler_outdir` argument. This must be
    Registered: Tue Sep 09 12:39:10 UTC 2025
    - Last Modified: Mon Aug 18 20:54:38 UTC 2025
    - 740K bytes
    - Viewed (2)
  4. lib/fips140/v1.0.0.zip

    replaced by shifting the virtual window we operate // over: T of the algorithm is T[i:] for us. That means that T1 in // Step 2 (T mod 2^_W) is simply T[i]. k0 in Step 3 is our m0inv. Y := T[i] * m.m0inv // Step 4 and 5 add Y × m to T, which as mentioned above is stored // at T[i:]. The two carries (from a × d and Y × m) are added up in // the next word T[n+i], and the carry bit from that addition is // brought forward to the next iteration. c2 := addMulVVW(T[i:n+i], mLimbs, Y) T[n+i], c = bits.Add(c1,...
    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