Search Options

Results per page
Sort
Preferred Languages
Advance

Results 1 - 5 of 5 for keeping (0.1 sec)

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

    * Improved **correctness** in corner cases.
    * **Safer** types.
    * Better **performance** and **less energy** consumption.
    * Better **extensibility**.
    * etc.
    
    ...all this while keeping the **same Python API**. In most of the cases, for simple models, you can simply upgrade the Pydantic version and get all the benefits. 🚀
    
    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. 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.
    Registered: Tue Sep 09 12:39:10 UTC 2025
    - Last Modified: Mon Aug 18 20:54:38 UTC 2025
    - 740K bytes
    - Viewed (1)
  3. 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:...
    Registered: Thu Sep 04 12:52:25 UTC 2025
    - Last Modified: Sun Jan 12 06:14:02 UTC 2025
    - 575.5K bytes
    - Viewed (0)
  4. lib/fips140/v1.0.0.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 -...
    Registered: Tue Sep 09 11:13:09 UTC 2025
    - Last Modified: Wed Jan 29 15:10:35 UTC 2025
    - 635K bytes
    - Viewed (0)
  5. 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
    Registered: Fri Sep 05 11:42:10 UTC 2025
    - Last Modified: Sat Feb 10 11:25:47 UTC 2024
    - 854.1K bytes
    - Viewed (0)
Back to top