- Sort Score
- Result 10 results
- Languages All
Results 41 - 50 of 2,849 for FOR (0.14 sec)
-
guava-tests/benchmark/com/google/common/hash/HashCodeBenchmark.java
import java.security.MessageDigest; import java.util.Arrays; import java.util.Random; /** * Benchmarks for comparing the various {@link HashCode#equals} methods. * * <p>Parameters for the benchmark are: * * <ul> * <li>size: the length of the byte array to hash * <li>whereToDiffer: where in the array the bytes should differ * <li>equalsImpl: which implementation of array equality to use * </ul> *
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Mon Dec 04 17:37:03 GMT 2017 - 3.9K bytes - Viewed (0) -
android/guava-tests/benchmark/com/google/common/hash/HashCodeBenchmark.java
import java.security.MessageDigest; import java.util.Arrays; import java.util.Random; /** * Benchmarks for comparing the various {@link HashCode#equals} methods. * * <p>Parameters for the benchmark are: * * <ul> * <li>size: the length of the byte array to hash * <li>whereToDiffer: where in the array the bytes should differ * <li>equalsImpl: which implementation of array equality to use * </ul> *
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Mon Dec 04 17:37:03 GMT 2017 - 3.9K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/graph/GraphMutationTest.java
int numNodesToRemove = gen.nextInt(NUM_NODES); for (int i = 0; i < numNodesToRemove; ++i) { assertThat(graph.removeNode(nodeList.get(i))).isTrue(); } assertThat(graph.nodes()).hasSize(NUM_NODES - numNodesToRemove); // Number of edges remaining is unknown (node's incident edges have been removed). AbstractGraphTest.validateGraph(graph); for (int i = numNodesToRemove; i < NUM_NODES; ++i) {
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) -
guava-tests/benchmark/com/google/common/util/concurrent/MonitorBenchmark.java
strings = new String[capacity]; for (int i = 0; i < capacity; i++) { strings[i] = String.valueOf(Math.random()); } } @Benchmark void addsAndRemoves(int reps) { int capacity = this.capacity; BlockingQueue<String> queue = this.queue; String[] strings = this.strings; for (int i = 0; i < reps; i++) { for (int j = 0; j < capacity; j++) { queue.add(strings[j]);
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Mon Dec 04 17:37:03 GMT 2017 - 2K bytes - Viewed (0) -
android/guava/src/com/google/common/util/concurrent/CycleDetectingLockFactory.java
// Create a LockGraphNode for each enum value. for (E key : keys) { LockGraphNode node = new LockGraphNode(getLockName(key)); nodes.add(node); map.put(key, node); } // Pre-populate all allowedPriorLocks with nodes of smaller ordinal. for (int i = 1; i < numKeys; i++) {
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Fri Dec 15 19:31:54 GMT 2023 - 35.9K bytes - Viewed (0) -
android/guava/src/com/google/common/base/Ascii.java
* }</pre> * * <p><b>Note:</b> This method <i>may</i> work with certain non-ASCII text but is not safe for use * with arbitrary Unicode text. It is mostly intended for use with text that is known to be safe * for use with it (such as all-ASCII text) and for simple debugging text. When using this method, * consider the following: * * <ul> * <li>it may split surrogate pairs
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Mon Jul 19 15:43:07 GMT 2021 - 21.6K bytes - Viewed (0) -
guava-testlib/src/com/google/common/testing/RelationshipTester.java
return this; } public void test() { for (int groupNumber = 0; groupNumber < groups.size(); groupNumber++) { ImmutableList<T> group = groups.get(groupNumber); for (int itemNumber = 0; itemNumber < group.size(); itemNumber++) { // check related items in same group for (int relatedItemNumber = 0; relatedItemNumber < group.size(); relatedItemNumber++) {
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Tue Apr 25 11:57:12 GMT 2023 - 5.9K bytes - Viewed (0) -
android/guava/src/com/google/common/util/concurrent/Monitor.java
* * <p>This class is intended as a replacement for {@link ReentrantLock}. Code using {@code Monitor} * is less error-prone and more readable than code using {@code ReentrantLock}, without significant * performance loss. {@code Monitor} even has the potential for performance gain by optimizing the * evaluation and signaling of conditions. Signaling is entirely <a
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Dec 04 18:22:01 GMT 2023 - 38.6K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/cache/CacheExpirationTest.java
WatchedCreatorLoader loader, FakeTicker ticker, CountingRemovalListener<String, Integer> removalListener) { for (int i = 0; i < 10; i++) { assertEquals(Integer.valueOf(VALUE_PREFIX + i), cache.getUnchecked(KEY_PREFIX + i)); } for (int i = 0; i < 10; i++) { loader.reset(); assertEquals(Integer.valueOf(VALUE_PREFIX + i), cache.getUnchecked(KEY_PREFIX + i));
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Fri Aug 05 17:21:46 GMT 2022 - 18.7K bytes - Viewed (0) -
android/guava-testlib/src/com/google/common/collect/testing/AbstractMapTester.java
} protected void expectMissingKeys(K... elements) { for (K element : elements) { assertFalse("Should not contain key " + element, getMap().containsKey(element)); } } protected void expectMissingValues(V... elements) { for (V element : elements) { assertFalse("Should not contain value " + element, getMap().containsValue(element)); } }
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed Feb 21 16:49:06 GMT 2024 - 7.5K bytes - Viewed (0)