- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 139 for nextInt (0.24 sec)
-
guava-tests/test/com/google/common/hash/HashTestUtils.java
int len = random.nextInt(value.length - off + 1); for (PrimitiveSink sink : sinks) { sink.putBytes(value, off, len); } } }, PUT_BYTE_BUFFER() { @Override void performAction(Random random, Iterable<? extends PrimitiveSink> sinks) { byte[] value = new byte[random.nextInt(128)]; random.nextBytes(value);
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Mon Oct 10 19:45:10 GMT 2022 - 25.3K bytes - Viewed (0) -
guava-tests/test/com/google/common/collect/ConcurrentHashMultisetBasherTest.java
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Mon Dec 04 17:37:03 GMT 2017 - 5.8K bytes - Viewed (0) -
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 Apr 19 12:43:09 GMT 2024 - Last Modified: Fri Aug 18 16:17:46 GMT 2017 - 4.2K 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) -
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 Apr 26 12:43:10 GMT 2024 - Last Modified: Fri Aug 18 16:17:46 GMT 2017 - 4.2K bytes - Viewed (0) -
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;
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) -
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() {
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Thu Mar 07 18:34:03 GMT 2024 - 36.1K bytes - Viewed (0) -
guava-tests/test/com/google/common/math/MathBenchmarking.java
double result = RANDOM_SOURCE.nextDouble(); result = Math.scalb(result, RANDOM_SOURCE.nextInt(maxExponent + 1)); return RANDOM_SOURCE.nextBoolean() ? result : -result; } /** Returns a random integer between zero and {@code MAX_EXPONENT}. */ static int randomExponent() { return RANDOM_SOURCE.nextInt(MAX_EXPONENT + 1); } static double randomPositiveDouble() {
Java - Registered: Fri Apr 12 12:43:09 GMT 2024 - Last Modified: Mon Dec 04 17:37:03 GMT 2017 - 4.1K bytes - Viewed (0) -
guava-tests/benchmark/com/google/common/collect/MinMaxPriorityQueueBenchmark.java
void setUp() { queue = heap.create(comparator.get()); for (int i = 0; i < size; i++) { queue.add(random.nextInt()); } } @Benchmark void pollAndAdd(int reps) { for (int i = 0; i < reps; i++) { // TODO(kevinb): precompute random #s? queue.add(queue.poll() ^ random.nextInt()); } } @Benchmark void populate(int reps) { for (int i = 0; i < reps; i++) {
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Wed Apr 19 19:24:36 GMT 2023 - 4.3K 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 Apr 26 12:43:10 GMT 2024 - Last Modified: Tue Feb 26 19:18:53 GMT 2019 - 4.9K bytes - Viewed (0)