- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 55 for Parker (0.17 sec)
-
guava-testlib/src/com/google/common/collect/testing/google/SortedMultisetTestSuiteBuilder.java
.suppressing(parentBuilder.getSuppressedTests()) .createTestSuite(); } /** * To avoid infinite recursion, test suites with these marker features won't have derived suites * created for them. */ enum NoRecurse implements Feature<Void> { SUBMULTISET, DESCENDING; @Override
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Feb 26 19:46:10 GMT 2024 - 11.9K bytes - Viewed (0) -
android/guava-testlib/src/com/google/common/collect/testing/google/SortedMultisetTestSuiteBuilder.java
.suppressing(parentBuilder.getSuppressedTests()) .createTestSuite(); } /** * To avoid infinite recursion, test suites with these marker features won't have derived suites * created for them. */ enum NoRecurse implements Feature<Void> { SUBMULTISET, DESCENDING; @Override
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Mon Feb 26 19:46:10 GMT 2024 - 11.9K bytes - Viewed (0) -
android/guava-testlib/src/com/google/common/testing/NullPointerTester.java
} /** * Verifies that {@code method} produces a {@link NullPointerException} or {@link * UnsupportedOperationException} when the parameter in position {@code paramIndex} is null. If * this parameter is marked nullable, this method does nothing. * * @param instance the instance to invoke {@code method} on, or null if {@code method} is static */
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Thu Nov 16 15:12:31 GMT 2023 - 22.8K bytes - Viewed (0) -
guava/src/com/google/common/collect/CompactHashSet.java
* * <p>Unlike {@code java.util.HashSet}, iteration is only proportional to the actual {@code size()}, * which is optimal, and <i>not</i> the size of the internal hashtable, which could be much larger * than {@code size()}. Furthermore, this structure only depends on a fixed number of arrays; {@code * add(x)} operations <i>do not</i> create objects for the garbage collector to deal with, and for
Java - Registered: Fri Apr 05 12:43:09 GMT 2024 - Last Modified: Mon Feb 05 21:38:59 GMT 2024 - 24.9K bytes - Viewed (0) -
guava/src/com/google/common/collect/CompactHashMap.java
* * <p>Unlike {@code java.util.HashMap}, iteration is only proportional to the actual {@code size()}, * which is optimal, and <i>not</i> the size of the internal hashtable, which could be much larger * than {@code size()}. Furthermore, this structure places significantly reduced load on the garbage * collector by only using a constant number of internal objects. *
Java - Registered: Fri Apr 05 12:43:09 GMT 2024 - Last Modified: Mon Jun 26 21:02:13 GMT 2023 - 39.8K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/hash/MacHashFunctionTest.java
byte[] key = fillByteArray(80, 0xaa); String data = "Test Using Larger Than Block-Size Key - Hash Key First"; checkSha1("aa4ae5e15272d00e95705637ce8a3b55ed402112", key, data); } public void testRfc2202_hmacSha1_case7() { byte[] key = fillByteArray(80, 0xaa); String data = "Test Using Larger Than Block-Size Key and Larger Than One Block-Size Data";
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed Sep 06 17:04:31 GMT 2023 - 13.8K bytes - Viewed (0) -
guava-testlib/src/com/google/common/collect/testing/SpliteratorTester.java
format( "estimated size of spliterator after trySplit (%s) is larger than original size (%s)", spliterator.estimateSize(), originalSize)); } if (trySplit != null) { if (trySplit.estimateSize() > originalSize) { fail( format( "estimated size of trySplit result (%s) is larger than original size (%s)", trySplit.estimateSize(), originalSize));
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Apr 22 18:19:31 GMT 2024 - 11.9K bytes - Viewed (0) -
android/guava/src/com/google/common/math/LongMath.java
* named analogously to their {@code BigInteger} counterparts. * * <p>The implementations of many methods in this class are based on material from Henry S. Warren, * Jr.'s <i>Hacker's Delight</i>, (Addison Wesley, 2002). * * <p>Similar functionality for {@code int} and for {@link BigInteger} can be found in {@link * IntMath} and {@link BigIntegerMath} respectively. For other common operations on {@code long}
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Wed Feb 07 17:50:39 GMT 2024 - 44.6K bytes - Viewed (0) -
android/guava/src/com/google/common/util/concurrent/CycleDetectingLockFactory.java
for (int i = 1; i < numKeys; i++) { nodes.get(i).checkAcquiredLocks(Policies.THROW, nodes.subList(0, i)); } // Pre-populate all disallowedPriorLocks with nodes of larger ordinal. for (int i = 0; i < numKeys - 1; i++) { nodes.get(i).checkAcquiredLocks(Policies.DISABLED, nodes.subList(i + 1, numKeys)); } return Collections.unmodifiableMap(map); } /**
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-tests/test/com/google/common/primitives/ImmutableDoubleArrayTest.java
for (int i = 0; i < array.length; i++) { array[i] = counter.getAndIncrement(); } builder.addAll(ImmutableDoubleArray.copyOf(array)); } }, ADD_LARGER_ARRAY { @Override void doIt(ImmutableDoubleArray.Builder builder, AtomicInteger counter) { double[] array = new double[RANDOM.nextInt(200) + 200]; for (int i = 0; i < array.length; i++) {
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Tue Jun 06 15:23:21 GMT 2023 - 20K bytes - Viewed (0)