Search Options

Results per page
Sort
Preferred Languages
Advance

Results 11 - 20 of 94 for nextLine (0.07 sec)

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

          exponent[i] = randomExponent();
          factorial[i] = RANDOM_SOURCE.nextInt(50);
          binomial[i] = RANDOM_SOURCE.nextInt(factorial[i] + 1);
          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;
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Mon Dec 04 17:37:03 UTC 2017
    - 3.2K bytes
    - Viewed (0)
  2. android/guava-tests/test/com/google/common/collect/MinMaxPriorityQueueTest.java

        for (int i = 0; i < heapSize; i++) {
          mmHeap.add(random.nextInt());
        }
        for (int i = 0; i < numberOfModifications; i++) {
          mmHeap.removeAt(random.nextInt(mmHeap.size()));
          assertIntactUsingSeed(seed, mmHeap);
          mmHeap.add(random.nextInt());
          assertIntactUsingSeed(seed, mmHeap);
        }
      }
    
      public void testRemoveAt_exhaustive() {
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Wed Oct 30 16:15:19 UTC 2024
    - 35.9K bytes
    - Viewed (0)
  3. guava-tests/test/com/google/common/graph/NetworkMutationTest.java

          assertThat(network.nodes()).isEmpty();
          assertThat(network.edges()).isEmpty();
          AbstractNetworkTest.validateNetwork(network);
    
          while (network.nodes().size() < NUM_NODES) {
            network.addNode(gen.nextInt(NODE_POOL_SIZE));
          }
          ArrayList<Integer> nodeList = new ArrayList<>(network.nodes());
          for (int i = 0; i < NUM_EDGES; ++i) {
            // Parallel edges are allowed, so this should always succeed.
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Wed Apr 10 19:42:18 UTC 2024
    - 4.5K bytes
    - Viewed (0)
  4. guava-tests/benchmark/com/google/common/collect/BinaryTreeTraverserBenchmark.java

                  new BinaryNode(
                      rng.nextInt(), createTree(leftChildSize, rng), createTree(rightChildSize, rng)));
            }
          }
        },
        ALL_LEFT {
          @Override
          Optional<BinaryNode> createTree(int size, Random rng) {
            Optional<BinaryNode> root = Optional.absent();
            for (int i = 0; i < size; i++) {
              root = Optional.of(new BinaryNode(rng.nextInt(), root, Optional.<BinaryNode>absent()));
            }
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Tue Feb 26 19:18:53 UTC 2019
    - 4.9K bytes
    - Viewed (0)
  5. android/guava-tests/benchmark/com/google/common/math/ApacheBenchmark.java

            }
          } while (!Impl.GUAVA.noMulOverflow(longsToMul[i][0], longsToMul[i][1]));
    
          int k = binomials[i][1] = RANDOM_SOURCE.nextInt(MathBenchmarking.biggestBinomials.length);
          binomials[i][0] = RANDOM_SOURCE.nextInt(MathBenchmarking.biggestBinomials[k] - k) + k;
        }
      }
    
      @Benchmark
      long factorialDouble(int reps) {
        long tmp = 0;
        for (int i = 0; i < reps; i++) {
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Mon Dec 04 17:37:03 UTC 2017
    - 6.9K bytes
    - Viewed (0)
  6. android/guava-tests/benchmark/com/google/common/math/BigIntegerMathBenchmark.java

      int factorialBound;
    
      @BeforeExperiment
      void setUp() {
        for (int i = 0; i < ARRAY_SIZE; i++) {
          factorials[i] = RANDOM_SOURCE.nextInt(factorialBound);
          slowFactorials[i] = RANDOM_SOURCE.nextInt(factorialBound);
          binomials[i] = RANDOM_SOURCE.nextInt(factorials[i] + 1);
        }
      }
    
      /** Previous version of BigIntegerMath.factorial, kept for timing purposes. */
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Mon Aug 19 16:21:24 UTC 2024
    - 3.4K bytes
    - Viewed (0)
  7. guava-tests/benchmark/com/google/common/math/LongMathBenchmark.java

          longs[i] = RANDOM_SOURCE.nextLong();
          factorialArguments[i] = RANDOM_SOURCE.nextInt(30);
          binomialArguments[i][1] = RANDOM_SOURCE.nextInt(MathBenchmarking.biggestBinomials.length);
          int k = binomialArguments[i][1];
          binomialArguments[i][0] = RANDOM_SOURCE.nextInt(MathBenchmarking.biggestBinomials[k] - k) + k;
        }
      }
    
      @Benchmark
      int pow(int reps) {
        int tmp = 0;
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Mon Dec 04 17:37:03 UTC 2017
    - 3.5K bytes
    - Viewed (0)
  8. android/guava-tests/test/com/google/common/util/concurrent/AtomicLongMapTest.java

        assertEquals(-1L, map.get(key));
      }
    
      public void testAddAndGet() {
        AtomicLongMap<String> map = AtomicLongMap.create();
        String key = "key";
        long addend = random.nextInt(MAX_ADDEND);
        for (int i = 0; i < ITERATIONS; i++) {
          long before = map.get(key);
          long result = map.addAndGet(key, addend);
          long after = map.get(key);
          assertEquals(before + addend, after);
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Tue Feb 13 14:28:25 UTC 2024
    - 17.4K bytes
    - Viewed (0)
  9. android/guava-tests/benchmark/com/google/common/base/WhitespaceMatcherBenchmark.java

          result[i] = allMatchingChars.charAt(random.nextInt(allMatchingChars.length()));
        }
        // Replace some of chars by non-matching.
        int remaining = (int) ((100 - percentMatching) * result.length / 100.0 + 0.5);
        while (remaining > 0) {
          final char c = (char) random.nextInt();
          if (bitSet.get(c)) {
            final int pos = random.nextInt(result.length);
            if (bitSet.get(result[pos])) {
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Wed May 16 22:49:59 UTC 2018
    - 3.9K bytes
    - Viewed (0)
  10. guava-tests/benchmark/com/google/common/base/WhitespaceMatcherBenchmark.java

          result[i] = allMatchingChars.charAt(random.nextInt(allMatchingChars.length()));
        }
        // Replace some of chars by non-matching.
        int remaining = (int) ((100 - percentMatching) * result.length / 100.0 + 0.5);
        while (remaining > 0) {
          final char c = (char) random.nextInt();
          if (bitSet.get(c)) {
            final int pos = random.nextInt(result.length);
            if (bitSet.get(result[pos])) {
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Wed May 16 22:49:59 UTC 2018
    - 3.9K bytes
    - Viewed (0)
Back to top