- Sort Score
- Num 10 results
- Language All
Results 1 - 5 of 5 for breakage (0.2 seconds)
-
RELEASE.md
for all the RNG in Keras. We plan to switch on the new code path by default in tf 2.8, and the behavior change will likely to cause some breakage on user side (eg if the test is checking against some golden number). These 3 APIs will allow user to disable and switch back to legacy behavior if they prefer. In future (eg TF 2.10), we expect toCreated: Tue Apr 07 12:39:13 GMT 2026 - Last Modified: Mon Mar 30 18:31:38 GMT 2026 - 746.5K bytes - Click Count (3) -
android/guava-tests/benchmark/com/google/common/base/LazyStackTraceBenchmark.java
return asList(t.getStackTrace()); } }; boolean timeIt(int reps, int breakAt) { boolean dummy = false; for (int i = 0; i < reps; i++) { int f = 0; Throwable t = new Throwable(); for (StackTraceElement ste : getStackTrace(t)) { dummy |= ste == duh; if (f++ == breakAt) { break; } } } return dummy; }
Created: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Thu Dec 19 18:03:30 GMT 2024 - 2.6K bytes - Click Count (0) -
guava-tests/benchmark/com/google/common/base/LazyStackTraceBenchmark.java
return asList(t.getStackTrace()); } }; boolean timeIt(int reps, int breakAt) { boolean dummy = false; for (int i = 0; i < reps; i++) { int f = 0; Throwable t = new Throwable(); for (StackTraceElement ste : getStackTrace(t)) { dummy |= ste == duh; if (f++ == breakAt) { break; } } } return dummy; }
Created: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Thu Dec 19 18:03:30 GMT 2024 - 2.6K bytes - Click Count (0) -
lib/fips140/v1.26.0.zip
= p - q diff.ExpandFor(p).Sub(qP, p) } // A tiny bit of leakage is acceptable because it's not adaptive, an // attacker only learns the magnitude of p - q. if diff.BitLenVarTime() <= N.BitLen()/2-100 { return errors.New("crypto/rsa: |p - q| too small") } // Check that d > 2^(nlen/2). // // See section 3 of https://crypto.stanford.edu/~dabo/papers/RSA-survey.pdf // for more details about attacks on small d values. // // Likewise, the leakage of the magnitude of d is not adaptive. if priv.d.BitLenVarTime()...
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
= p - q diff.ExpandFor(p).Sub(qP, p) } // A tiny bit of leakage is acceptable because it's not adaptive, an // attacker only learns the magnitude of p - q. if diff.BitLenVarTime() <= N.BitLen()/2-100 { return errors.New("crypto/rsa: |p - q| too small") } // Check that d > 2^(nlen/2). // // See section 3 of https://crypto.stanford.edu/~dabo/papers/RSA-survey.pdf // for more details about attacks on small d values. // // Likewise, the leakage of the magnitude of d is not adaptive. if priv.d.BitLenVarTime()...
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)