- Sort Score
- Result 10 results
- Languages All
Results 21 - 30 of 94 for nextLine (0.13 sec)
-
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) -
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() {
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Mon Dec 04 17:37:03 UTC 2017 - 4.1K bytes - Viewed (0) -
android/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) -
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) {
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Fri Aug 18 16:17:46 UTC 2017 - 4.2K bytes - Viewed (0) -
android/guava-tests/benchmark/com/google/common/base/AsciiBenchmark.java
char[] array = Chars.toArray(chars); this.testString = new String(array); } private char randomAlpha() { return ALPHA.charAt(random.nextInt(ALPHA.length())); } private char randomNonAlpha() { return NONALPHA.charAt(random.nextInt(NONALPHA.length())); } @Benchmark int asciiStringToUpperCase(int reps) { String string = noWorkToDo ? Ascii.toUpperCase(testString) : testString;
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Mon Dec 04 17:37:03 UTC 2017 - 4.8K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/primitives/ImmutableIntArrayTest.java
int num = RANDOM.nextInt(10); for (int i = 0; i < num; i++) { list.add(counter.getAndIncrement()); } builder.addAll(iterable(list)); } }, ADD_STREAM { @Override void doIt(ImmutableIntArray.Builder builder, AtomicInteger counter) { int[] array = new int[RANDOM.nextInt(10)]; for (int i = 0; i < array.length; i++) {
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Fri Oct 25 18:05:56 UTC 2024 - 20.1K bytes - Viewed (0) -
guava-tests/test/com/google/common/primitives/ImmutableDoubleArrayTest.java
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Fri Oct 25 18:05:56 UTC 2024 - 21.2K bytes - Viewed (0) -
android/guava-tests/benchmark/com/google/common/collect/MultisetIteratorBenchmark.java
// TODO(kevinb): generate better test contents for multisets while (sizeRemaining > 0) { // The JVM will return interned values for small ints. Integer value = random.nextInt(1000) + 128; int count = min(random.nextInt(10) + 1, sizeRemaining); sizeRemaining -= count; hashMultiset.add(value, count); linkedHashMultiset.add(value, count); treeMultiset.add(value, count); }
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Fri Oct 18 20:24:49 UTC 2024 - 2.7K bytes - Viewed (0) -
guava-tests/benchmark/com/google/common/collect/MultisetIteratorBenchmark.java
// TODO(kevinb): generate better test contents for multisets while (sizeRemaining > 0) { // The JVM will return interned values for small ints. Integer value = random.nextInt(1000) + 128; int count = min(random.nextInt(10) + 1, sizeRemaining); sizeRemaining -= count; hashMultiset.add(value, count); linkedHashMultiset.add(value, count); treeMultiset.add(value, count); }
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Fri Oct 18 20:24:49 UTC 2024 - 2.7K bytes - Viewed (0) -
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)