- Sort Score
- Num 10 results
- Language All
Results 1 - 5 of 5 for breakage (0.12 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 Dec 30 12:39:10 GMT 2025 - Last Modified: Tue Oct 28 22:27:41 GMT 2025 - 740.4K bytes - Click Count (3) -
impl/maven-core/src/test/java/org/apache/maven/project/RepositoryLeakageTest.java
// Check for leakage: child2 should NOT have child1's repository boolean child2HasChild1Repo = child2Project.getRemoteArtifactRepositories().stream() .anyMatch(repo -> "child1-repo".equals(repo.getId())); assertFalse(child2HasChild1Repo, "Child2 should NOT have child1's repository (leakage detected!)"); // Check for leakage in the shared requestCreated: Sun Dec 28 03:35:09 GMT 2025 - Last Modified: Thu Oct 16 06:12:36 GMT 2025 - 9.3K bytes - Click Count (0) -
impl/maven-core/src/main/java/org/apache/maven/project/DefaultProjectBuilder.java
private final ModelBuilder.ModelBuilderSession modelBuilderSession; private final Map<String, MavenProject> projectIndex = new ConcurrentHashMap<>(256); // Store computed repositories per project to avoid leakage between projects private final Map<String, List<ArtifactRepository>> projectRepositories = new ConcurrentHashMap<>(); /**Created: Sun Dec 28 03:35:09 GMT 2025 - Last Modified: Tue Nov 18 17:20:31 GMT 2025 - 51.8K 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 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
= 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 Dec 30 11:13:12 GMT 2025 - Last Modified: Thu Dec 11 16:27:41 GMT 2025 - 663K bytes - Click Count (0)