Search Options

Display Count
Sort
Preferred Language
Advanced Search

Results 1 - 4 of 4 for Goexit (0.08 seconds)

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

        * New docs: [Dependencies with `yield` - Early exit and `scope`](https://fastapi.tiangolo.com/tutorial/dependencies/dependencies-with-yield/#early-exit-and-scope).
    
    ### Internal
    
    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

        during shape inference in `Cudnn*` ops
        ([CVE-2021-41221](https://cve.mitre.org/cgi-bin/cvename.cgi?name=CVE-2021-41221))
    *   Fixes a null pointer exception when `Exit` node is not preceded by `Enter`
        op
        ([CVE-2021-41217](https://cve.mitre.org/cgi-bin/cvename.cgi?name=CVE-2021-41217))
    *   Fixes an integer division by 0 in `tf.raw_ops.AllToAll`
    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.0.0-c2097c7c.zip

    After each loop iteration, u and v only get smaller, and at least one of // them shrinks by at least a factor of two. for { // If both u and v are odd, subtract the smaller from the larger. // If u = v, we need to subtract from v to hit the modified exit condition. if u.IsOdd() == yes && v.IsOdd() == yes { if v.cmpGeq(u) == no { u.sub(v) A.Add(C, &Modulus{nat: m}) B.Add(D, &Modulus{nat: a}) } else { v.sub(u) C.Add(A, &Modulus{nat: m}) D.Add(B, &Modulus{nat: a}) } } // Exactly one of u and v is now...
    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

    After each loop iteration, u and v only get smaller, and at least one of // them shrinks by at least a factor of two. for { // If both u and v are odd, subtract the smaller from the larger. // If u = v, we need to subtract from v to hit the modified exit condition. if u.IsOdd() == yes && v.IsOdd() == yes { if v.cmpGeq(u) == no { u.sub(v) A.Add(C, &Modulus{nat: m}) B.Add(D, &Modulus{nat: a}) } else { v.sub(u) C.Add(A, &Modulus{nat: m}) D.Add(B, &Modulus{nat: a}) } } // Exactly one of u and v is now...
    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