- Sort Score
- Num 10 results
- Language All
Results 1 - 6 of 6 for are (0.1 seconds)
-
RELEASE.md
different computation approaches and orders. * To verify if oneDNN optimizations are on, look for a message with *"oneDNN custom operations are on"* in the log. If the exact phrase is not there, it means they are off. * Making the `tf.function` type system fully available: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) -
CHANGELOG/CHANGELOG-1.19.md
- All StorageClass parameters for volume provisioning are supported. - All features supported with PersistentVolumeClaims are supported, such as storage capacity tracking, snapshots and restore, and volume resizing. ### Immutable Secrets and ConfigMaps (beta) Secret and ConfigMap volumes can be marked as immutable, which significantly reduces load on the API server if there are many Secret and ConfigMap volumes in the cluster.
Created: Fri Dec 26 09:05:12 GMT 2025 - Last Modified: Wed Jan 05 05:42:32 GMT 2022 - 489.7K bytes - Click Count (0) -
lib/fips140/v1.0.0-c2097c7c.zip
panic("bigmod: modulus for Exp must be odd") } // We use a 4 bit window. For our RSA workload, 4 bit windows are faster // than 2 bit windows, but use an extra 12 nats worth of scratch space. // Using bit sizes that don't divide 8 are more complex to implement, but // are likely to be more efficient if necessary. table := [(1 << 4) - 1]*Nat{ // table[i] = x ^ (i+1) // newNat calls are unrolled so they are allocated on the stack. NewNat(), NewNat(), NewNat(), NewNat(), NewNat(), NewNat(), NewNat(), NewNat(),...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) -
lib/fips140/v1.1.0-rc1.zip
panic("bigmod: modulus for Exp must be odd") } // We use a 4 bit window. For our RSA workload, 4 bit windows are faster // than 2 bit windows, but use an extra 12 nats worth of scratch space. // Using bit sizes that don't divide 8 are more complex to implement, but // are likely to be more efficient if necessary. table := [(1 << 4) - 1]*Nat{ // table[i] = x ^ (i+1) // newNat calls are unrolled so they are allocated on the stack. NewNat(), NewNat(), NewNat(), NewNat(), NewNat(), NewNat(), NewNat(), NewNat(),...Created: Tue Dec 30 11:13:12 GMT 2025 - Last Modified: Thu Dec 11 16:27:41 GMT 2025 - 663K bytes - Click Count (0) -
docs/en/docs/release-notes.md
* Different `dependencies` can be applied to different routers. * These `dependencies` are run before the normal parameter dependencies. And normal dependencies are run too. They can be combined. * Dependencies declared in a router are executed first, then the ones defined in *path operation decorators*, and then the ones declared in normal parameters. They are all combined and executed.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) -
okhttp-idna-mapping-table/src/main/resources/okhttp3/internal/idna/IdnaMappingTable.txt
# IdnaMappingTable.txt # Date: 2023-08-10, 22:32:27 GMT # © 2023 Unicode®, Inc. # Unicode and the Unicode Logo are registered trademarks of Unicode, Inc. in the U.S. and other countries. # For terms of use, see https://www.unicode.org/terms_of_use.html # # Unicode IDNA Compatible Preprocessing for UTS #46 # Version: 15.1.0 # # For documentation and usage, see https://www.unicode.org/reports/tr46 #
Created: Fri Dec 26 11:42:13 GMT 2025 - Last Modified: Sat Feb 10 11:25:47 GMT 2024 - 854.1K bytes - Click Count (0)