Search Options

Display Count
Sort
Preferred Language
Advanced Search

Results 1 - 7 of 7 for breakage (0.07 seconds)

  1. build-logic/binary-compatibility/src/main/groovy/gradlebuild/binarycompatibility/rules/BinaryBreakingSuperclassChangeRule.groovy

    import javassist.CtClass
    import me.champeau.gradle.japicmp.report.Violation
    
    /**
     * Workaround for <a href="https://github.com/melix/japicmp-gradle-plugin/issues/56">japicmp issue w.r.t. superclass breakage</a>.
     *
     * <p>
     * Reports simple superclass changes (e.g. the removal of a superclass) as a breaking change, as it affects what methods can be
     * called with the given type, even if the methods and fields inherited don't change.
    Created: Wed Apr 01 11:36:16 GMT 2026
    - Last Modified: Thu Oct 06 19:15:15 GMT 2022
    - 1.8K bytes
    - Click Count (0)
  2. 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 to
    Created: Tue Apr 07 12:39:13 GMT 2026
    - Last Modified: Mon Mar 30 18:31:38 GMT 2026
    - 746.5K bytes
    - Click Count (3)
  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)
  4. 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)
  5. CHANGELOG/CHANGELOG-1.7.md

    * kubeadm deb/rpm packages: cAdvisor doesn't listen on `0.0.0.0:4194` without authentication/authorization because of the possible information leakage. The cAdvisor API can still be accessed via `https://{node-ip}:10250/stats/`, though. ([kubernetes/release#356](https://github.com/kubernetes/release/pull/356), [@luxas](https://github.com/luxas))
    
    
    ### Cloud Providers
    
    Created: Fri Apr 03 09:05:14 GMT 2026
    - Last Modified: Thu May 05 13:44:43 GMT 2022
    - 308.7K bytes
    - Click Count (1)
  6. 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)
  7. 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)
Back to Top