- Sort Score
- Result 10 results
- Languages All
Results 1 - 4 of 4 for refactored (0.08 sec)
-
docs/en/docs/release-notes.md
Registered: Sun Sep 07 07:19:17 UTC 2025 - Last Modified: Fri Sep 05 12:48:45 UTC 2025 - 544.1K bytes - Viewed (0) -
RELEASE.md
* Add an option to disallow `NNAPI` CPU / partial acceleration on Android 10 * TFLite Android AARs now include the C headers and APIs are required to use TFLite from native code. * Refactors the delegate and delegate kernel sources to allow usage in the linter. * Limit delegated ops to actually supported ones if a device name is specified or `NNAPI` CPU Fallback is disabled.
Registered: Tue Sep 09 12:39:10 UTC 2025 - Last Modified: Mon Aug 18 20:54:38 UTC 2025 - 740K bytes - Viewed (2) -
CHANGELOG/CHANGELOG-1.19.md
- Reduce event spam during a volume operation error. ([#89794](https://github.com/kubernetes/kubernetes/pull/89794), [@msau42](https://github.com/msau42)) [SIG Storage] - Refactor the local nodeipam range allocator and instrument the cidrset used to store the allocated CIDRs with the following metrics: "cidrset_cidrs_allocations_total", "cidrset_cidrs_releases_total", "cidrset_usage_cidrs",
Registered: Fri Sep 05 09:05:11 UTC 2025 - Last Modified: Wed Jan 05 05:42:32 UTC 2022 - 489.7K bytes - Viewed (0) -
lib/fips140/v1.0.0.zip
bigmod.NewNat().Mod(q.Nat(), p) } if qP.Mul(priv.qInv, p).IsOne() != 1 { return errors.New("crypto/rsa: invalid CRT coefficient") } // Check that |p - q| > 2^(nlen/2 - 100). // // If p and q are very close to each other, then N=pq can be trivially // factored using Fermat's factorization method. Broken RSA implementations // do generate such keys. See Hanno Böck, Fermat Factorization in the Wild, // https://eprint.iacr.org/2023/026.pdf. diff := bigmod.NewNat() if qP, err := bigmod.NewNat().SetBytes(q.Nat().Bytes(q),...
Registered: Tue Sep 09 11:13:09 UTC 2025 - Last Modified: Wed Jan 29 15:10:35 UTC 2025 - 635K bytes - Viewed (0)