- Sort Score
- Num 10 results
- Language All
Results 1 - 5 of 5 for very (0.15 seconds)
-
RELEASE.md
* If you use the very rarely-used function `tf.keras.mixed_precision.experimental.get_layer_policy`: * Replace `tf.keras.mixed_precision.experimental.get_layer_policy(layer)` with `layer.dtype_policy`.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) -
docs/en/docs/release-notes.md
## 0.120.0 There are no major nor breaking changes in this release. ☕️ The internal reference documentation now uses `annotated_doc.Doc` instead of `typing_extensions.Doc`, this adds a new (very small) dependency on [`annotated-doc`](https://github.com/fastapi/annotated-doc), a package made just to provide that `Doc` documentation utility class.
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) -
lib/fips140/v1.1.0-rc1.zip
as explained in maybeSubtractModulus can be the // case both if x >= m, or if x overflowed). // // The paper suggests in Section 4 that we can do an "Almost Montgomery // Multiplication" by subtracting only in the overflow case, but the // cost is very similar since the constant time subtraction tells us if // x >= m as a side effect, and taking care of the broken invariant is // highly undesirable (see https://go.dev/issue/13907). copy(x.reset(n).limbs, T[n:]) x.maybeSubtractModulus(choice(c), m)...
Created: Tue Dec 30 11:13:12 GMT 2025 - Last Modified: Thu Dec 11 16:27:41 GMT 2025 - 663K bytes - Click Count (0) -
src/cmd/asm/internal/asm/testdata/amd64enc.s
VDPPS $7, Y11, Y15, Y11 // c4430540db07 VERR (BX) // 0f0023 VERR (R11) // 410f0023 VERR DX // 0f00e2 VERR R11 // 410f00e3 VERW (BX) // 0f002b VERW (R11) // 410f002b VERW DX // 0f00ea
Created: Tue Dec 30 11:13:12 GMT 2025 - Last Modified: Fri Oct 08 21:38:44 GMT 2021 - 581.9K bytes - Click Count (1) -
lib/fips140/v1.0.0-c2097c7c.zip
as explained in maybeSubtractModulus can be the // case both if x >= m, or if x overflowed). // // The paper suggests in Section 4 that we can do an "Almost Montgomery // Multiplication" by subtracting only in the overflow case, but the // cost is very similar since the constant time subtraction tells us if // x >= m as a side effect, and taking care of the broken invariant is // highly undesirable (see https://go.dev/issue/13907). copy(x.reset(n).limbs, T[n:]) x.maybeSubtractModulus(choice(c), m)...
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)