- Sort Score
- Num 10 results
- Language All
Results 321 - 325 of 325 for goexit (0.1 seconds)
The search processing time has exceeded the limit. The displayed results may be partial.
-
CHANGELOG/CHANGELOG-1.34.md
## Changelog since v1.34.3 ## Changes by Kind ### Feature
Created: Fri Apr 03 09:05:14 GMT 2026 - Last Modified: Thu Mar 19 03:19:43 GMT 2026 - 368.7K bytes - Click Count (2) -
CHANGELOG/CHANGELOG-1.32.md
## Changelog since v1.32.11 ## Changes by Kind ### Feature
Created: Fri Apr 03 09:05:14 GMT 2026 - Last Modified: Thu Feb 26 23:58:21 GMT 2026 - 470.5K bytes - Click Count (0) -
CHANGELOG/CHANGELOG-1.23.md
Created: Fri Apr 03 09:05:14 GMT 2026 - Last Modified: Tue Feb 28 21:06:52 GMT 2023 - 424.5K bytes - Click Count (0) -
lib/fips140/v1.26.0.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 Apr 07 11:13:11 GMT 2026 - Last Modified: Thu Jan 08 17:58:32 GMT 2026 - 660.3K bytes - Click Count (0) -
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 Apr 07 11:13:11 GMT 2026 - Last Modified: Thu Sep 25 19:53:19 GMT 2025 - 642.7K bytes - Click Count (0)