- Sort Score
- Result 10 results
- Languages All
Results 41 - 50 of 254 for Nash (0.14 sec)
-
android/guava-tests/test/com/google/common/collect/MapMakerInternalMapTest.java
// count == 0 segment.setTableEntryForTesting(index, entry); assertNull(segment.get(key, hash)); assertFalse(segment.containsKey(key, hash)); assertFalse(segment.containsValue(value)); // count == 1 segment.count++; assertSame(value, segment.get(key, hash)); assertTrue(segment.containsKey(key, hash)); assertTrue(segment.containsValue(value));
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Tue Feb 20 17:00:05 GMT 2024 - 35.1K bytes - Viewed (0) -
android/guava/src/com/google/common/hash/Hashing.java
return (bits + 31) & ~31; } /** * Returns a hash function which computes its hash code by concatenating the hash codes of the * underlying hash functions together. This can be useful if you need to generate hash codes of a * specific length. * * <p>For example, if you need 1024-bit hash codes, you could join two {@link Hashing#sha512} hash
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) -
maven-core/src/main/java/org/apache/maven/project/artifact/DefaultProjectArtifactsCache.java
int hash = 17; hash = hash * 31 + Objects.hashCode(groupId); hash = hash * 31 + Objects.hashCode(artifactId); hash = hash * 31 + Objects.hashCode(version); hash = hash * 31 + Objects.hashCode(dependencyArtifacts); hash = hash * 31 + Objects.hashCode(workspace); hash = hash * 31 + Objects.hashCode(localRepo);
Java - Registered: Sun May 05 03:35:11 GMT 2024 - Last Modified: Wed Feb 28 23:31:49 GMT 2024 - 8.3K bytes - Viewed (0) -
maven-core/src/main/java/org/apache/maven/plugin/DefaultPluginArtifactsCache.java
} this.filter = extensionFilter; int hash = 17; hash = hash * 31 + CacheUtils.pluginHashCode(plugin); hash = hash * 31 + Objects.hashCode(workspace); hash = hash * 31 + Objects.hashCode(localRepo); hash = hash * 31 + RepositoryUtils.repositoriesHashCode(repositories); hash = hash * 31 + Objects.hashCode(extensionFilter); this.hashCode = hash;
Java - Registered: Sun May 05 03:35:11 GMT 2024 - Last Modified: Wed Sep 06 08:39:32 GMT 2023 - 5.8K bytes - Viewed (0) -
src/main/java/org/codelibs/fess/helper/DocumentHelper.java
} } public String decodeSimilarDocHash(final String hash) { if (hash != null && hash.startsWith(SIMILAR_DOC_HASH_PREFIX) && hash.length() > SIMILAR_DOC_HASH_PREFIX.length()) { final byte[] decode = Base64.getUrlDecoder().decode(hash.substring(SIMILAR_DOC_HASH_PREFIX.length())); try (BufferedReader reader =
Java - Registered: Mon May 06 08:04:11 GMT 2024 - Last Modified: Thu Feb 22 01:37:57 GMT 2024 - 12K bytes - Viewed (0) -
android/guava/src/com/google/common/hash/Hasher.java
* following three expressions all generate colliding hash codes: * * <pre>{@code * newHasher().putByte(b1).putByte(b2).putByte(b3).hash() * newHasher().putByte(b1).putBytes(new byte[] { b2, b3 }).hash() * newHasher().putBytes(new byte[] { b1, b2, b3 }).hash() * }</pre> * * <p>If you wish to avoid this, you should either prepend or append the size of each chunk. Keep in
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Wed Jun 15 20:59:00 GMT 2022 - 5.5K bytes - Viewed (0) -
maven-compat/src/main/java/org/apache/maven/artifact/resolver/filter/OrArtifactFilter.java
Java - Registered: Sun May 05 03:35:11 GMT 2024 - Last Modified: Wed Sep 06 11:28:54 GMT 2023 - 2.1K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/hash/MacHashFunctionTest.java
assertThrows(IllegalStateException.class, () -> hasher.putInt(42)); } public void testHashTwice() { Hasher hasher = Hashing.hmacMd5(MD5_KEY).newHasher(); assertEquals( "9753980fe94daa8ecaa82216519393a9", hasher.putString("The quick brown fox jumps over the lazy dog", UTF_8).hash().toString());
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/testing/RelationshipTester.java
itemInfo, relatedInfo, equivalence.equivalent(item, related)); int itemHash = equivalence.hash(item); int relatedHash = equivalence.hash(related); assertWithTemplate( "the $HASH (" + itemHash + ") of $ITEM must be equal to the $HASH (" + relatedHash + ") of $OTHER", itemInfo, relatedInfo,
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) -
guava/src/com/google/common/base/SmallCharMatcher.java
import com.google.common.annotations.VisibleForTesting; import com.google.common.base.CharMatcher.NamedFastMatcher; import java.util.BitSet; /** * An immutable version of CharMatcher for smallish sets of characters that uses a hash table with * linear probing to check for matches. * * @author Christopher Swenson */ @GwtIncompatible // no precomputation is done in GWT @ElementTypesAreNonnullByDefault
Java - Registered: Fri Apr 05 12:43:09 GMT 2024 - Last Modified: Fri Feb 09 15:49:48 GMT 2024 - 4.5K bytes - Viewed (0)