Search Options

Display Count
Sort
Preferred Language
Advanced Search

Results 1 - 4 of 4 for Badger (0.07 seconds)

  1. RELEASE.md

    *   Unified eager and `tf.function` execution:
    
        *   Eager mode can now execute each op as a `tf.function`, allowing for more
            consistent feature support in future releases.
        *   It is available for immediate use.
            *   See the `TF_RUN_EAGER_OP_AS_FUNCTION` environment variable in
    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)
  2. docs/en/docs/release-notes.md

    * 🔧 Update sponsors badge configs. PR [#5155](https://github.com/tiangolo/fastapi/pull/5155) by [@tiangolo](https://github.com/tiangolo).
    * 👥 Update FastAPI People. PR [#5154](https://github.com/tiangolo/fastapi/pull/5154) 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)
  3. lib/fips140/v1.0.0-c2097c7c.zip

    non-zero. If GCDVarTime returns an error, x is not modified. // // The output will be resized to the size of the larger of a and b. func (x *Nat) GCDVarTime(a, b *Nat) (*Nat, error) { u, _, err := extendedGCD(a, b) if err != nil { return nil, err } return x.set(u), nil } // extendedGCD computes u and A such that a = GCD(a, m) and u = A*a - B*m. // // u will have the size of the larger of a and m, and A will have the size of m. // // It is an error if either a or m is zero, or if they are both even....
    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)
  4. lib/fips140/v1.1.0-rc1.zip

    are non-zero. If GCDVarTime returns an error, x is not modified. // // The output will be resized to the size of the larger of a and b. func (x *Nat) GCDVarTime(a, b *Nat) (*Nat, error) { u, _, err := extendedGCD(a, b) if err != nil { return nil, err } return x.set(u), nil } // extendedGCD computes u and A such that u = GCD(a, m) = A*a - B*m. // // u will have the size of the larger of a and m, and A will have the size of m. // // It is an error if either a or m is zero, or if they are both even....
    Created: Tue Dec 30 11:13:12 GMT 2025
    - Last Modified: Thu Dec 11 16:27:41 GMT 2025
    - 663K bytes
    - Click Count (0)
Back to Top