- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 37 for Harper (0.24 sec)
-
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 Apr 19 12:43:09 GMT 2024 - Last Modified: Wed Sep 06 17:04:31 GMT 2023 - 13.8K bytes - Viewed (0) -
src/main/java/org/codelibs/fess/helper/QueryHelper.java
import org.codelibs.fess.mylasta.action.FessUserBean; import org.codelibs.fess.mylasta.direction.FessConfig; import org.codelibs.fess.query.QueryFieldConfig; import org.codelibs.fess.query.parser.QueryParser; import org.codelibs.fess.score.QueryRescorer; import org.codelibs.fess.util.ComponentUtil; import org.dbflute.optional.OptionalThing; import org.lastaflute.core.message.UserMessages;
Java - Registered: Mon May 06 08:04:11 GMT 2024 - Last Modified: Thu Feb 22 01:37:57 GMT 2024 - 11.9K bytes - Viewed (0) -
guava/src/com/google/common/collect/AbstractMapBasedMultiset.java
/* * Cache the size for efficiency. Using a long lets us avoid the need for * overflow checking and ensures that size() will function correctly even if * the multiset had once been larger than Integer.MAX_VALUE. */ private transient long size; /** Standard constructor. */ protected AbstractMapBasedMultiset(Map<E, Count> backingMap) { checkArgument(backingMap.isEmpty());
Java - Registered: Fri Apr 05 12:43:09 GMT 2024 - Last Modified: Mon Mar 06 16:06:58 GMT 2023 - 10.4K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/primitives/ImmutableLongArrayTest.java
for (int i = 0; i < array.length; i++) { array[i] = counter.getAndIncrement(); } builder.addAll(ImmutableLongArray.copyOf(array)); } }, ADD_LARGER_ARRAY { @Override void doIt(ImmutableLongArray.Builder builder, AtomicLong counter) { long[] array = new long[RANDOM.nextInt(200) + 200]; for (int i = 0; i < array.length; i++) {
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Thu Jun 01 09:32:35 GMT 2023 - 19K bytes - Viewed (0) -
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 Apr 12 12:43:09 GMT 2024 - Last Modified: Thu Jun 01 09:32:35 GMT 2023 - 21.3K bytes - Viewed (0) -
android/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 May 03 12:43:13 GMT 2024 - Last Modified: Mon Feb 05 21:38:59 GMT 2024 - 24K bytes - Viewed (0) -
android/guava/src/com/google/common/math/IntMath.java
* Returns {@code false} if {@code n} is zero, one, or a composite number (one which <i>can</i> be * factored into smaller positive integers). * * <p>To test larger numbers, use {@link LongMath#isPrime} or {@link BigInteger#isProbablePrime}. * * @throws IllegalArgumentException if {@code n} is negative * @since 20.0 */ @GwtIncompatible // TODO
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Wed Feb 07 17:50:39 GMT 2024 - 23.5K 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/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)