- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 53 for runcom (0.14 sec)
-
guava-tests/test/com/google/common/primitives/UnsignedIntsTest.java
} } } @GwtIncompatible // Too slow in GWT (~3min fully optimized) public void testDivideRemainderEuclideanProperty() { // Use a seed so that the test is deterministic: Random r = new Random(0L); for (int i = 0; i < 1000000; i++) { int dividend = r.nextInt(); int divisor = r.nextInt(); // Test that the Euclidean property is preserved: assertThat( dividend
Java - Registered: Fri Apr 12 12:43:09 GMT 2024 - Last Modified: Tue Feb 06 16:10:08 GMT 2024 - 12.7K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/base/Utf8Test.java
utf8Lengths.put(MIN_SUPPLEMENTARY_CODE_POINT, 4); utf8Lengths.put(MAX_CODE_POINT, 4); Integer[] codePoints = utf8Lengths.keySet().toArray(new Integer[] {}); StringBuilder sb = new StringBuilder(); Random rnd = new Random(); for (int trial = 0; trial < 100; trial++) { sb.setLength(0); int utf8Length = 0; for (int i = 0; i < 6; i++) { Integer randomCodePoint = codePoints[rnd.nextInt(codePoints.length)];
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Fri Feb 09 15:49:48 GMT 2024 - 12.7K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/primitives/ShortsTest.java
assertThat(Shorts.fromBytes((byte) 0xFE, (byte) 0xDC)).isEqualTo((short) 0xFEDC); } @GwtIncompatible // Shorts.fromByteArray, Shorts.toByteArray public void testByteArrayRoundTrips() { Random r = new Random(5); byte[] b = new byte[Shorts.BYTES]; // total overkill, but, it takes 0.1 sec so why not... for (int i = 0; i < 10000; i++) { short num = (short) r.nextInt();
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Thu Feb 29 15:43:06 GMT 2024 - 26.6K bytes - Viewed (0) -
android/guava/src/com/google/common/hash/Hashing.java
* Returns a general-purpose, <b>temporary-use</b>, non-cryptographic hash function. The algorithm * the returned function implements is unspecified and subject to change without notice. * * <p><b>Warning:</b> a new random seed for these functions is chosen each time the {@code * Hashing} class is loaded. <b>Do not use this method</b> if hash codes may escape the current
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Tue Apr 09 00:37:15 GMT 2024 - 29.2K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/Iterables.java
} private static <T extends @Nullable Object> boolean removeIfFromRandomAccessList( List<T> list, Predicate<? super T> predicate) { // Note: Not all random access lists support set(). Additionally, it's possible // for a list to reject setting an element, such as when the list does not permit // duplicate elements. For both of those cases, we need to fall back to a slower
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed Apr 24 19:38:27 GMT 2024 - 42.8K bytes - Viewed (0) -
guava-tests/test/com/google/common/collect/MinMaxPriorityQueueTest.java
long seed = new Random().nextLong(); Random random = new Random(seed); insertRandomly(elements, q, random); return seed; } private static void insertRandomly( ArrayList<Integer> elements, MinMaxPriorityQueue<Integer> q, Random random) { while (!elements.isEmpty()) { int selectedIndex = random.nextInt(elements.size());
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Thu Mar 07 18:34:03 GMT 2024 - 36.1K 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) -
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) -
android/guava-tests/test/com/google/common/primitives/UnsignedLongsTest.java
} @GwtIncompatible // Too slow in GWT (~3min fully optimized) public void testDivideRemainderEuclideanProperty() { // Use a seed so that the test is deterministic: Random r = new Random(0L); for (int i = 0; i < 1000000; i++) { long dividend = r.nextLong(); long divisor = r.nextLong(); // Test that the Euclidean property is preserved: assertThat(
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Fri Feb 09 15:36:17 GMT 2024 - 13.2K bytes - Viewed (0)