Search Options

Results per page
Sort
Preferred Languages
Advance

Results 1 - 10 of 173 for positively (0.23 sec)

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

     * @author Louis Wasserman
     */
    public class IntMathRoundingBenchmark {
      private static final int[] positive = new int[ARRAY_SIZE];
      private static final int[] nonzero = new int[ARRAY_SIZE];
      private static final int[] ints = new int[ARRAY_SIZE];
    
      @BeforeExperiment
      void setUp() {
        for (int i = 0; i < ARRAY_SIZE; i++) {
          positive[i] = randomPositiveBigInteger(Integer.SIZE - 2).intValue();
    Registered: Wed Jun 12 16:38:11 UTC 2024
    - Last Modified: Mon Dec 04 17:37:03 UTC 2017
    - 2.6K bytes
    - Viewed (0)
  2. android/guava-tests/benchmark/com/google/common/math/LongMathBenchmark.java

      private static final long[] positive = new long[ARRAY_SIZE];
      private static final long[] nonnegative = new long[ARRAY_SIZE];
      private static final long[] longs = new long[ARRAY_SIZE];
    
      @BeforeExperiment
      void setUp() {
        for (int i = 0; i < ARRAY_SIZE; i++) {
          exponents[i] = randomExponent();
          positive[i] = randomPositiveBigInteger(Long.SIZE - 1).longValue();
    Registered: Wed Jun 12 16:38:11 UTC 2024
    - Last Modified: Mon Dec 04 17:37:03 UTC 2017
    - 3.5K bytes
    - Viewed (0)
  3. guava-tests/benchmark/com/google/common/math/BigIntegerMathRoundingBenchmark.java

      private static final BigInteger[] nonzero2 = new BigInteger[ARRAY_SIZE];
      private static final BigInteger[] positive = new BigInteger[ARRAY_SIZE];
    
      @Param({"DOWN", "UP", "FLOOR", "CEILING", "HALF_EVEN", "HALF_UP", "HALF_DOWN"})
      RoundingMode mode;
    
      @BeforeExperiment
      void setUp() {
        for (int i = 0; i < ARRAY_SIZE; i++) {
          positive[i] = randomPositiveBigInteger(1024);
          nonzero1[i] = randomNonZeroBigInteger(1024);
    Registered: Wed Jun 12 16:38:11 UTC 2024
    - Last Modified: Tue Jun 30 13:06:20 UTC 2020
    - 2.8K bytes
    - Viewed (0)
  4. android/guava-tests/benchmark/com/google/common/math/BigIntegerMathRoundingBenchmark.java

      private static final BigInteger[] nonzero2 = new BigInteger[ARRAY_SIZE];
      private static final BigInteger[] positive = new BigInteger[ARRAY_SIZE];
    
      @Param({"DOWN", "UP", "FLOOR", "CEILING", "HALF_EVEN", "HALF_UP", "HALF_DOWN"})
      RoundingMode mode;
    
      @BeforeExperiment
      void setUp() {
        for (int i = 0; i < ARRAY_SIZE; i++) {
          positive[i] = randomPositiveBigInteger(1024);
          nonzero1[i] = randomNonZeroBigInteger(1024);
    Registered: Wed Jun 12 16:38:11 UTC 2024
    - Last Modified: Tue Jun 30 13:06:20 UTC 2020
    - 2.8K bytes
    - Viewed (0)
  5. analysis/analysis-api-platform-interface/src/org/jetbrains/kotlin/analysis/api/platform/declarations/KotlinAnnotationsResolver.kt

    import org.jetbrains.kotlin.psi.KtAnnotated
    import org.jetbrains.kotlin.psi.KtElement
    
    /**
     * A service to match declarations with their annotations and vice versa.
     *
     * N.B. This service can produce both false positives and false negatives from time to time, since it might not be allowed to use
     * full-blown resolve to understand the true FqName of used annotation.
     *
     * The next statement should be `true` for any `annotation`:
     * ```
    Registered: Wed Jun 12 09:53:16 UTC 2024
    - Last Modified: Thu Jun 06 17:57:40 UTC 2024
    - 2.6K bytes
    - Viewed (0)
  6. guava-tests/benchmark/com/google/common/math/IntMathBenchmark.java

          positive[i] = randomPositiveBigInteger(Integer.SIZE - 1).intValue();
          nonnegative[i] = randomNonNegativeBigInteger(Integer.SIZE - 1).intValue();
          ints[i] = RANDOM_SOURCE.nextInt();
        }
      }
    
      @Benchmark
      int pow(int reps) {
        int tmp = 0;
        for (int i = 0; i < reps; i++) {
          int j = i & ARRAY_MASK;
          tmp += IntMath.pow(positive[j], exponent[j]);
        }
        return tmp;
    Registered: Wed Jun 12 16:38:11 UTC 2024
    - Last Modified: Mon Dec 04 17:37:03 UTC 2017
    - 3.2K bytes
    - Viewed (0)
  7. android/guava-tests/benchmark/com/google/common/math/LongMathRoundingBenchmark.java

      RoundingMode mode;
    
      private static final long[] positive = new long[ARRAY_SIZE];
      private static final long[] nonzero = new long[ARRAY_SIZE];
      private static final long[] longs = new long[ARRAY_SIZE];
    
      @BeforeExperiment
      void setUp() {
        for (int i = 0; i < ARRAY_SIZE; i++) {
          positive[i] = randomPositiveBigInteger(Long.SIZE - 2).longValue();
    Registered: Wed Jun 12 16:38:11 UTC 2024
    - Last Modified: Mon Dec 04 17:37:03 UTC 2017
    - 2.6K bytes
    - Viewed (0)
  8. guava-tests/benchmark/com/google/common/math/IntMathRoundingBenchmark.java

     * @author Louis Wasserman
     */
    public class IntMathRoundingBenchmark {
      private static final int[] positive = new int[ARRAY_SIZE];
      private static final int[] nonzero = new int[ARRAY_SIZE];
      private static final int[] ints = new int[ARRAY_SIZE];
    
      @BeforeExperiment
      void setUp() {
        for (int i = 0; i < ARRAY_SIZE; i++) {
          positive[i] = randomPositiveBigInteger(Integer.SIZE - 2).intValue();
    Registered: Wed Jun 12 16:38:11 UTC 2024
    - Last Modified: Mon Dec 04 17:37:03 UTC 2017
    - 2.6K bytes
    - Viewed (0)
  9. guava/src/com/google/common/hash/SipHashFunction.java

      /**
       * @param c the number of compression rounds (must be positive)
       * @param d the number of finalization rounds (must be positive)
       * @param k0 the first half of the key
       * @param k1 the second half of the key
       */
      SipHashFunction(int c, int d, long k0, long k1) {
        checkArgument(
            c > 0, "The number of SipRound iterations (c=%s) during Compression must be positive.", c);
        checkArgument(
    Registered: Wed Jun 12 16:38:11 UTC 2024
    - Last Modified: Tue Apr 20 18:43:59 UTC 2021
    - 5.3K bytes
    - Viewed (0)
  10. android/guava/src/com/google/common/hash/SipHashFunction.java

      /**
       * @param c the number of compression rounds (must be positive)
       * @param d the number of finalization rounds (must be positive)
       * @param k0 the first half of the key
       * @param k1 the second half of the key
       */
      SipHashFunction(int c, int d, long k0, long k1) {
        checkArgument(
            c > 0, "The number of SipRound iterations (c=%s) during Compression must be positive.", c);
        checkArgument(
    Registered: Wed Jun 12 16:38:11 UTC 2024
    - Last Modified: Tue Apr 20 18:43:59 UTC 2021
    - 5.3K bytes
    - Viewed (0)
Back to top