Search Options

Display Count
Sort
Preferred Language
Advanced Search

Results 1 - 6 of 6 for keeping (0.07 seconds)

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

    * ⬆️ Upgrade OpenAI model for translations to gpt-5.2. PR [#14579](https://github.com/fastapi/fastapi/pull/14579) by [@tiangolo](https://github.com/tiangolo).
    
    ## 0.126.0
    
    ### Upgrades
    
    * ➖ Drop support for Pydantic v1, keeping short temporary support for Pydantic v2's `pydantic.v1`. PR [#14575](https://github.com/fastapi/fastapi/pull/14575) by [@tiangolo](https://github.com/tiangolo).
        * The minimum version of Pydantic installed is now `pydantic >=2.7.0`.
    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)
  2. RELEASE.md

    *   Added an Mfcc op for speech feature generation.
    *   Improved DirectSession::Run() overhead and error checking. Feeding a value
        of the wrong type will now synchronously raise an INVALID_ARGUMENT error
        instead of asynchronously raising an INTERNAL error. Code that depends on
        the (undefined) behavior when feeding a tensor of the wrong type may need to
        be updated.
    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. lib/fips140/v1.1.0-rc1.zip

    j := range t[i] { t1[i][j], w[j] = power2Round(t[i][j]) } t0[i] = ntt(w) } // The computations below (and their storage in the PrivateKey struct) are // not strictly necessary and could be deferred to PrivateKey.PublicKey(). // That would require keeping or re-deriving ρ and t/t1, though. pk := pkEncode(priv.pub.raw[:0], ρ, t1, p) priv.pub.tr = computePublicKeyHash(pk) computeT1Hat(priv.pub.t1[:k], t1) // NTT(t₁ ⋅ 2ᵈ) return priv } func computeMatrixA(A []nttElement, ρ []byte, p parameters) { k, l...
    Created: Tue Dec 30 11:13:12 GMT 2025
    - Last Modified: Thu Dec 11 16:27:41 GMT 2025
    - 663K bytes
    - Click Count (0)
  4. src/main/webapp/css/bootstrap.min.css.map

    scss-docs-end stacks\n","//\n// Visually hidden\n//\n\n.visually-hidden,\n.visually-hidden-focusable:not(:focus):not(:focus-within) {\n  @include visually-hidden();\n}\n","// stylelint-disable declaration-no-important\n\n// Hide content visually while keeping it accessible to assistive technologies\n//\n// See: https://www.a11yproject.com/posts/2013-01-11-how-to-hide-content/\n// See: https://kittygiraudel.com/2016/10/13/css-hide-and-seek/\n\n@mixin visually-hidden() {\n  width: 1px !important;\n  height:...
    Created: Sat Dec 20 09:19:18 GMT 2025
    - Last Modified: Sun Jan 12 06:14:02 GMT 2025
    - 575.5K bytes
    - Click Count (0)
  5. lib/fips140/v1.0.0-c2097c7c.zip

    s[0] = byteorder.BEUint64(x[24:]) s[1] = byteorder.BEUint64(x[16:]) s[2] = byteorder.BEUint64(x[8:]) s[3] = byteorder.BEUint64(x[:]) // Ensure s is in the range [0, ord(G)-1]. Since 2 * ord(G) > 2²⁵⁶, we can // just conditionally subtract ord(G), keeping the result if it doesn't // underflow. t0, b := bits.Sub64(s[0], 0xf3b9cac2fc632551, 0) t1, b := bits.Sub64(s[1], 0xbce6faada7179e84, b) t2, b := bits.Sub64(s[2], 0xffffffffffffffff, b) t3, b := bits.Sub64(s[3], 0xffffffff00000000, b) tMask := b -...
    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)
  6. okhttp-idna-mapping-table/src/main/resources/okhttp3/internal/idna/IdnaMappingTable.txt

    1F630..1F633  ; valid                  ;      ; NV8    # 6.0  FACE WITH OPEN MOUTH AND COLD SWEAT..FLUSHED FACE
    1F634         ; valid                  ;      ; NV8    # 6.1  SLEEPING FACE
    1F635..1F640  ; valid                  ;      ; NV8    # 6.0  DIZZY FACE..WEARY CAT FACE
    1F641..1F642  ; valid                  ;      ; NV8    # 7.0  SLIGHTLY FROWNING FACE..SLIGHTLY SMILING FACE
    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