longDate - Code Search

src/archive/tar/testdata/ustar.tar

longname/longname/longname/longname/longname/longname/longname/longname/longname/longname/longname/longname/longname/longname/longname/file.txt hello...

TAR Archive

- Registered: Tue Apr 30 11:13:12 GMT 2024

- Last Modified: Mon Sep 08 04:08:51 GMT 2014

- 2K bytes

- Viewed (0)

github.com/google/guava

android/guava-tests/benchmark/com/google/common/math/LongMathBenchmark.java

    int tmp = 0;
    for (int i = 0; i < reps; i++) {
      int j = i & ARRAY_MASK;
      tmp += LongMath.pow(positive[j], exponents[j]);
    }
    return tmp;
  }

  @Benchmark
  int mod(int reps) {
    int tmp = 0;
    for (int i = 0; i < reps; i++) {
      int j = i & ARRAY_MASK;
      tmp += LongMath.mod(longs[j], positive[j]);
    }
    return tmp;
  }

  @Benchmark
  int gCD(int reps) {

Java

- Registered: Fri Apr 26 12:43:10 GMT 2024

- Last Modified: Mon Dec 04 17:37:03 GMT 2017

- 3.5K bytes

- Viewed (0)

github.com/google/guava

guava-tests/benchmark/com/google/common/math/LongMathBenchmark.java

    int tmp = 0;
    for (int i = 0; i < reps; i++) {
      int j = i & ARRAY_MASK;
      tmp += LongMath.pow(positive[j], exponents[j]);
    }
    return tmp;
  }

  @Benchmark
  int mod(int reps) {
    int tmp = 0;
    for (int i = 0; i < reps; i++) {
      int j = i & ARRAY_MASK;
      tmp += LongMath.mod(longs[j], positive[j]);
    }
    return tmp;
  }

  @Benchmark
  int gCD(int reps) {

Java

- Registered: Fri Apr 19 12:43:09 GMT 2024

- Last Modified: Mon Dec 04 17:37:03 GMT 2017

- 3.5K bytes

- Viewed (0)

github.com/google/guava

android/guava-tests/benchmark/com/google/common/math/LongMathRoundingBenchmark.java

    int tmp = 0;
    for (int i = 0; i < reps; i++) {
      int j = i & ARRAY_MASK;
      tmp += LongMath.log2(positive[j], mode);
    }
    return tmp;
  }

  @Benchmark
  int log10(int reps) {
    int tmp = 0;
    for (int i = 0; i < reps; i++) {
      int j = i & ARRAY_MASK;
      tmp += LongMath.log10(positive[j], mode);
    }
    return tmp;
  }

  @Benchmark
  int sqrt(int reps) {

Java

- Registered: Fri Apr 26 12:43:10 GMT 2024

- Last Modified: Mon Dec 04 17:37:03 GMT 2017

- 2.6K bytes

- Viewed (0)

github.com/google/guava

guava-tests/benchmark/com/google/common/math/LongMathRoundingBenchmark.java

    int tmp = 0;
    for (int i = 0; i < reps; i++) {
      int j = i & ARRAY_MASK;
      tmp += LongMath.log2(positive[j], mode);
    }
    return tmp;
  }

  @Benchmark
  int log10(int reps) {
    int tmp = 0;
    for (int i = 0; i < reps; i++) {
      int j = i & ARRAY_MASK;
      tmp += LongMath.log10(positive[j], mode);
    }
    return tmp;
  }

  @Benchmark
  int sqrt(int reps) {

Java

- Registered: Fri Apr 19 12:43:09 GMT 2024

- Last Modified: Mon Dec 04 17:37:03 GMT 2017

- 2.6K bytes

- Viewed (0)

github.com/google/guava

guava-tests/benchmark/com/google/common/math/ApacheBenchmark.java

        return IntMath.gcd(a, b);
      }

      @Override
      public long gcdLong(long a, long b) {
        return LongMath.gcd(a, b);
      }

      @Override
      public long binomialCoefficient(int n, int k) {
        return LongMath.binomial(n, k);
      }

      @Override
      public boolean noAddOverflow(int a, int b) {
        try {

Java

- Registered: Fri Apr 19 12:43:09 GMT 2024

- Last Modified: Mon Dec 04 17:37:03 GMT 2017

- 6.9K bytes

- Viewed (0)

github.com/google/guava

android/guava-tests/benchmark/com/google/common/math/ApacheBenchmark.java

        return IntMath.gcd(a, b);
      }

      @Override
      public long gcdLong(long a, long b) {
        return LongMath.gcd(a, b);
      }

      @Override
      public long binomialCoefficient(int n, int k) {
        return LongMath.binomial(n, k);
      }

      @Override
      public boolean noAddOverflow(int a, int b) {
        try {

Java

- Registered: Fri Apr 26 12:43:10 GMT 2024

- Last Modified: Mon Dec 04 17:37:03 GMT 2017

- 6.9K bytes

- Viewed (0)

github.com/google/guava

android/guava-tests/benchmark/com/google/common/math/BigIntegerMathBenchmark.java

  private static BigInteger oldSlowFactorial(int n) {
    if (n <= 20) {
      return BigInteger.valueOf(LongMath.factorial(n));
    } else {
      int k = 20;
      return BigInteger.valueOf(LongMath.factorial(k)).multiply(oldSlowFactorial(k, n));
    }
  }

  /** Returns the product of {@code n1} exclusive through {@code n2} inclusive. */

Java

- Registered: Fri Apr 26 12:43:10 GMT 2024

- Last Modified: Mon Dec 04 17:37:03 GMT 2017

- 3.3K bytes

- Viewed (0)

github.com/google/guava

guava-tests/benchmark/com/google/common/math/BigIntegerMathBenchmark.java

  private static BigInteger oldSlowFactorial(int n) {
    if (n <= 20) {
      return BigInteger.valueOf(LongMath.factorial(n));
    } else {
      int k = 20;
      return BigInteger.valueOf(LongMath.factorial(k)).multiply(oldSlowFactorial(k, n));
    }
  }

  /** Returns the product of {@code n1} exclusive through {@code n2} inclusive. */

Java

- Registered: Fri Apr 19 12:43:09 GMT 2024

- Last Modified: Mon Dec 04 17:37:03 GMT 2017

- 3.3K bytes

- Viewed (0)

github.com/google/guava

guava-tests/test/com/google/common/math/QuantilesAlgorithm.java

      return builder.buildOrThrow();
    }

    private double singleQuantileFromSorted(int index, int scale, double[] dataset) {
      long numerator = (long) index * (dataset.length - 1);
      int positionFloor = (int) LongMath.divide(numerator, scale, RoundingMode.DOWN);
      int remainder = (int) (numerator - positionFloor * scale);
      if (remainder == 0) {
        return dataset[positionFloor];
      } else {

Java

- Registered: Fri Apr 12 12:43:09 GMT 2024

- Last Modified: Tue Feb 01 16:30:37 GMT 2022

- 7.1K bytes

- Viewed (0)

Search Options