- Sort Score
- Result 10 results
- Languages All
Results 71 - 80 of 215 for runcom (0.29 sec)
-
guava-tests/benchmark/com/google/common/math/LessThanBenchmark.java
@BeforeExperiment void setUp() { Random random = new Random(randomSeed); xInts = new int[SAMPLE_SIZE]; yInts = new int[SAMPLE_SIZE]; xLongs = new long[SAMPLE_SIZE]; yLongs = new long[SAMPLE_SIZE]; constant = new int[SAMPLE_SIZE]; for (int i = 0; i < SAMPLE_SIZE; i++) { xInts[i] = random.nextInt(Integer.MAX_VALUE); yInts[i] = random.nextInt(Integer.MAX_VALUE);
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Mon Dec 04 17:37:03 GMT 2017 - 4K bytes - Viewed (0) -
guava-tests/benchmark/com/google/common/collect/MultisetIteratorBenchmark.java
treeMultiset = TreeMultiset.create(); Random random = new Random(); int sizeRemaining = size; // TODO(kevinb): generate better test contents for multisets for (int i = 0; sizeRemaining > 0; i++) { // The JVM will return interned values for small ints. Integer value = random.nextInt(1000) + 128; int count = Math.min(random.nextInt(10) + 1, sizeRemaining); sizeRemaining -= count;
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Mon Dec 04 17:37:03 GMT 2017 - 2.6K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/util/concurrent/AtomicLongMapBasherTest.java
* * @author mike nonemacher */ @J2ktIncompatible // threads @GwtIncompatible // threads public class AtomicLongMapBasherTest extends TestCase { private final Random random = new Random(301); public void testModify_basher() throws Exception { int nTasks = 3000; int nThreads = 100; final int getsPerTask = 1000; final int deltaRange = 10000; final String key = "key";
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Tue Feb 13 14:28:25 GMT 2024 - 4.2K bytes - Viewed (0) -
android/guava-tests/benchmark/com/google/common/base/WhitespaceMatcherBenchmark.java
return new String(result); } private static String newTestString(Random random, BitSet bitSet, int percentMatching) { final String allMatchingChars = allMatchingChars(bitSet); final char[] result = new char[STRING_LENGTH]; // Fill with matching chars. for (int i = 0; i < result.length; i++) { result[i] = allMatchingChars.charAt(random.nextInt(allMatchingChars.length())); }
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed May 16 22:49:59 GMT 2018 - 3.9K bytes - Viewed (0) -
guava-tests/test/com/google/common/io/ByteSourceTester.java
if (slice && bytes.length > 0) { // test a random slice() of the ByteSource Random random = new Random(); byte[] expected = factory.getExpected(bytes); // if expected.length == 0, off has to be 0 but length doesn't matter--result will be empty int off = expected.length == 0 ? 0 : random.nextInt(expected.length); int len = expected.length == 0 ? 4 : random.nextInt(expected.length - off);
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Wed Sep 06 17:04:31 GMT 2023 - 8.6K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/hash/AbstractByteHasherTest.java
hasher.putChar((char) 0x0201); hasher.assertBytes(new byte[] {1, 2}); } public void testString() { Random random = new Random(); for (int i = 0; i < 100; i++) { byte[] bytes = new byte[64]; random.nextBytes(bytes); String s = new String(bytes, UTF_16LE); // so all random strings are valid assertEquals( new TestHasher().putUnencodedChars(s).hash(),
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed Sep 06 17:04:31 GMT 2023 - 3.8K bytes - Viewed (0) -
android/guava-tests/benchmark/com/google/common/collect/ConcurrentHashMultisetBenchmark.java
total += future.get(); } return total; } private long runAddSingleThread(int reps) { Random random = new Random(); int nKeys = keys.size(); long blah = 0; for (int i = 0; i < reps; i++) { Integer key = keys.get(random.nextInt(nKeys)); int delta = random.nextInt(5); blah += delta; multiset.add(key, delta); } return blah; }
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Thu Apr 06 12:56:11 GMT 2023 - 16.6K 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) -
guava-tests/test/com/google/common/graph/NetworkMutationTest.java
@Test public void undirectedNetwork() { testNetworkMutation(NetworkBuilder.undirected()); } private static void testNetworkMutation(NetworkBuilder<? super Integer, Object> networkBuilder) { Random gen = new Random(42); // Fixed seed so test results are deterministic. for (int trial = 0; trial < NUM_TRIALS; ++trial) { MutableNetwork<Integer, Object> network =
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/src/com/google/common/cache/Striped64.java
* class-unloading when ThreadLocals are not removed. */ static final ThreadLocal<int @Nullable []> threadHashCode = new ThreadLocal<>(); /** Generator of new random hash codes */ static final Random rng = new Random(); /** Number of CPUS, to place bound on table size */ static final int NCPU = Runtime.getRuntime().availableProcessors(); /** Table of cells. When non-null, size is a power of 2. */
Java - Registered: Fri Apr 05 12:43:09 GMT 2024 - Last Modified: Thu Feb 22 17:40:56 GMT 2024 - 11.5K bytes - Viewed (0)