Search Options

Results per page
Sort
Preferred Languages
Advance

Results 1 - 5 of 5 for Franchina (0.16 sec)

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

    import org.gradle.api.tasks.TaskAction
    import org.gradle.work.DisableCachingByDefault
    
    /**
     * A task used for cleaning up all accepted API changes. The functionality is called whenever the release process initiates "branching".
     */
    @DisableCachingByDefault(because = "Not worth caching")
    class CleanAcceptedApiChanges extends DefaultTask {
    
        @PathSensitive(PathSensitivity.ABSOLUTE)
        @InputFile
        File jsonFile
    
    Groovy
    - Registered: Wed Apr 17 11:36:08 GMT 2024
    - Last Modified: Wed Jul 07 13:12:26 GMT 2021
    - 1.4K bytes
    - Viewed (0)
  2. guava/src/com/google/common/base/Ascii.java

          char c1 = s1.charAt(i);
          char c2 = s2.charAt(i);
          if (c1 == c2) {
            continue;
          }
          int alphaIndex = getAlphaIndex(c1);
          // This was also benchmarked using '&' to avoid branching (but always evaluate the rhs),
          // however this showed no obvious improvement.
          if (alphaIndex < 26 && alphaIndex == getAlphaIndex(c2)) {
            continue;
          }
          return false;
        }
    Java
    - Registered: Fri Apr 05 12:43:09 GMT 2024
    - Last Modified: Mon Jul 19 15:43:07 GMT 2021
    - 21.6K bytes
    - Viewed (0)
  3. android/guava/src/com/google/common/math/IntMath.java

          // Both a and b are odd. Assume a > b; then gcd(a - b, b) = gcd(a, b).
          // But in gcd(a - b, b), a - b is even and b is odd, so we can divide out powers of two.
    
          // We bend over backwards to avoid branching, adapting a technique from
          // http://graphics.stanford.edu/~seander/bithacks.html#IntegerMinOrMax
    
          int delta = a - b; // can't overflow, since a and b are nonnegative
    
    Java
    - Registered: Fri Apr 19 12:43:09 GMT 2024
    - Last Modified: Wed Feb 07 17:50:39 GMT 2024
    - 23.5K bytes
    - Viewed (0)
  4. android/guava/src/com/google/common/base/Ascii.java

          char c1 = s1.charAt(i);
          char c2 = s2.charAt(i);
          if (c1 == c2) {
            continue;
          }
          int alphaIndex = getAlphaIndex(c1);
          // This was also benchmarked using '&' to avoid branching (but always evaluate the rhs),
          // however this showed no obvious improvement.
          if (alphaIndex < 26 && alphaIndex == getAlphaIndex(c2)) {
            continue;
          }
          return false;
        }
    Java
    - Registered: Fri Apr 19 12:43:09 GMT 2024
    - Last Modified: Mon Jul 19 15:43:07 GMT 2021
    - 21.6K bytes
    - Viewed (0)
  5. android/guava/src/com/google/common/math/LongMath.java

          // Both a and b are odd. Assume a > b; then gcd(a - b, b) = gcd(a, b).
          // But in gcd(a - b, b), a - b is even and b is odd, so we can divide out powers of two.
    
          // We bend over backwards to avoid branching, adapting a technique from
          // http://graphics.stanford.edu/~seander/bithacks.html#IntegerMinOrMax
    
          long delta = a - b; // can't overflow, since a and b are nonnegative
    
    Java
    - Registered: Fri Apr 19 12:43:09 GMT 2024
    - Last Modified: Wed Feb 07 17:50:39 GMT 2024
    - 44.6K bytes
    - Viewed (0)
Back to top