- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 114 for nextInt (0.27 sec)
-
android/guava-tests/test/com/google/common/graph/GraphMutationTest.java
assertThat(graph.nodes()).isEmpty(); assertThat(graph.edges()).isEmpty(); AbstractGraphTest.validateGraph(graph); while (graph.nodes().size() < NUM_NODES) { graph.addNode(gen.nextInt(NODE_POOL_SIZE)); } ArrayList<Integer> nodeList = new ArrayList<>(graph.nodes()); while (graph.edges().size() < NUM_EDGES) {
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Fri Aug 18 16:17:46 GMT 2017 - 4.2K bytes - Viewed (0) -
android/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())); }
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Tue Feb 26 19:18:53 GMT 2019 - 4.9K bytes - Viewed (0) -
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;
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Mon Dec 04 17:37:03 GMT 2017 - 3.2K bytes - Viewed (0) -
guava-tests/test/com/google/common/primitives/ImmutableLongArrayTest.java
long num = RANDOM.nextInt(10); for (int i = 0; i < num; i++) { list.add(counter.getAndIncrement()); } builder.addAll(list); } }, ADD_ITERABLE { @Override void doIt(ImmutableLongArray.Builder builder, AtomicLong counter) { List<Long> list = new ArrayList<>(); long num = RANDOM.nextInt(10); for (int i = 0; i < num; i++) {
Java - Registered: Fri Apr 12 12:43:09 GMT 2024 - Last Modified: Thu Jun 01 09:32:35 GMT 2023 - 20.2K bytes - Viewed (0) -
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])) {
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Wed May 16 22:49:59 GMT 2018 - 3.9K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/primitives/ImmutableDoubleArrayTest.java
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Tue Jun 06 15:23:21 GMT 2023 - 20K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/collect/ConcurrentHashMultisetBasherTest.java
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Mon Dec 04 17:37:03 GMT 2017 - 5.8K bytes - Viewed (0) -
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.
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Wed Apr 10 19:42:18 GMT 2024 - 4.5K bytes - Viewed (0) -
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);
Java - Registered: Fri Apr 12 12:43:09 GMT 2024 - Last Modified: Tue Feb 13 14:28:25 GMT 2024 - 17.4K bytes - Viewed (0) -
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. */
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)