- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 79 for Nash (0.19 sec)
-
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 Apr 19 12:43:09 GMT 2024 - Last Modified: Tue Feb 20 17:00:05 GMT 2024 - 35.1K bytes - Viewed (0) -
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) -
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) -
android/guava/src/com/google/common/collect/RegularImmutableMap.java
* objects per entry. Instead we use an open-addressed hash table. This design is basically * equivalent to RegularImmutableSet, save that instead of having a hash table containing the * elements directly and null for empty positions, we store indices of the keys in the hash table, * and ABSENT for empty positions. We then look up the keys in alternatingKeysAndValues. *
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Mon Apr 15 22:32:14 GMT 2024 - 22.7K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/Multimap.java
@Override boolean equals(@CheckForNull Object obj); /** * Returns the hash code for this multimap. * * <p>The hash code of a multimap is defined as the hash code of the map view, as returned by * {@link Multimap#asMap}. * * <p>In general, two multimaps with identical key-value mappings may or may not have the same * hash codes, depending on the implementation. For example, two {@link SetMultimap} instances
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Sat Jun 17 14:40:53 GMT 2023 - 15.1K bytes - Viewed (0) -
guava-gwt/src-super/com/google/common/collect/super/com/google/common/collect/ImmutableMap.java
public boolean equals(@Nullable Object object) { return Maps.equalsImpl(this, object); } @Override public int hashCode() { // not caching hash code since it could change if map values are mutable // in a way that modifies their hash codes return entrySet().hashCode(); } @Override public String toString() { return Maps.toStringImpl(this); }
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Tue Feb 27 19:19:19 GMT 2024 - 17.1K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/base/PredicatesTest.java
assertEquals(actual + " should hash like " + expected, expected.hashCode(), actual.hashCode()); } public void testHashCodeForBooleanOperations() { Predicate<@Nullable Integer> p1 = Predicates.isNull(); Predicate<@Nullable Integer> p2 = isOdd(); // Make sure that hash codes are not computed per-instance.
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Thu Feb 22 17:15:24 GMT 2024 - 32.4K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/hash/BloomFilterTest.java
* limitations under the License. */ package com.google.common.hash; import static com.google.common.base.Charsets.UTF_8; import static com.google.common.truth.Truth.assertThat; import static org.junit.Assert.assertThrows; import com.google.common.base.Stopwatch; import com.google.common.collect.ImmutableSet; import com.google.common.hash.BloomFilterStrategies.LockFreeBitArray; import com.google.common.math.LongMath;
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Thu Nov 09 22:49:56 GMT 2023 - 21.3K bytes - Viewed (0) -
guava/src/com/google/common/collect/HashBiMap.java
import java.util.function.BiConsumer; import java.util.function.BiFunction; import javax.annotation.CheckForNull; import org.checkerframework.checker.nullness.qual.Nullable; /** * A {@link BiMap} backed by two hash tables. This implementation allows null keys and values. A * {@code HashBiMap} and its inverse are both serializable. * * <p>This implementation guarantees insertion-based iteration order of its keys. *
Java - Registered: Fri Apr 05 12:43:09 GMT 2024 - Last Modified: Fri Oct 13 14:11:58 GMT 2023 - 24.5K bytes - Viewed (0)