- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 13 for Nash (0.18 sec)
-
android/guava/src/com/google/common/collect/MapMakerInternalMap.java
if (key == null) { return null; } int hash = hash(key); return segmentFor(hash).getEntry(key, hash); } @Override public boolean containsKey(@CheckForNull Object key) { if (key == null) { return false; } int hash = hash(key); return segmentFor(hash).containsKey(key, hash); } @Override
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Mon Apr 01 16:15:01 GMT 2024 - 91.9K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/Sets.java
adjust = ~~adjust; // in GWT, we have to deal with integer overflow carefully } int hash = 1; for (Set<E> axis : axes) { hash = 31 * hash + (size() / axis.size() * axis.hashCode()); hash = ~~hash; } hash += adjust; return ~~hash; } } /** * Returns the set of all possible subsets of {@code set}. For example, {@code
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed May 01 18:44:57 GMT 2024 - 77.4K bytes - Viewed (0) -
android/guava/src/com/google/common/base/CharMatcher.java
* * <p>This implementation tries to be smart in a number of ways. It recognizes cases where the * negation is cheaper to precompute than the matcher itself; it tries to build small hash tables * for matchers that only match a few characters, and so on. In the worst-case scenario, it * constructs an eight-kilobyte bit array and queries that. In many situations this produces a
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Fri Feb 09 15:49:48 GMT 2024 - 53.7K bytes - Viewed (0) -
maven-core/src/main/java/org/apache/maven/project/MavenProject.java
&& Objects.equals(getGroupId(), that.getGroupId()) && Objects.equals(getVersion(), that.getVersion()); } @Override public int hashCode() { return Objects.hash(getGroupId(), getArtifactId(), getVersion()); } public List<Extension> getBuildExtensions() { Build build = getBuild(); if ((build == null) || (build.getExtensions() == null)) {
Java - Registered: Sun May 05 03:35:11 GMT 2024 - Last Modified: Fri Mar 01 17:18:13 GMT 2024 - 56.6K bytes - Viewed (0) -
guava-tests/test/com/google/common/collect/SetsTest.java
Set<Set<Integer>> reverse = powerSet(ImmutableSet.copyOf(elements.asList().reverse())); new EqualsTester().addEqualityGroup(forward, reverse).testEquals(); } /** * Test that a hash code miscomputed by "input.hashCode() * tooFarValue / 2" is correct under our * {@code hashCode} implementation. */ public void testPowerSetHashCode_inputHashCodeTimesTooFarValueIsZero() {
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Thu Mar 07 18:34:03 GMT 2024 - 49.3K bytes - Viewed (0) -
guava-tests/test/com/google/common/collect/MapsTest.java
Maps.capacity(-1); fail("Negative expected size must result in IllegalArgumentException"); } catch (IllegalArgumentException expected) { } } /** * Tests that nHMWES makes hash maps large enough that adding the expected number of elements * won't cause a rehash. * * <p>As of jdk7u40, HashMap has an empty-map optimization. The argument to new HashMap(int) is
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Mon Mar 04 16:06:01 GMT 2024 - 67.2K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/collect/MapsTest.java
Maps.capacity(-1); fail("Negative expected size must result in IllegalArgumentException"); } catch (IllegalArgumentException expected) { } } /** * Tests that nHMWES makes hash maps large enough that adding the expected number of elements * won't cause a rehash. * * <p>As of jdk7u40, HashMap has an empty-map optimization. The argument to new HashMap(int) is
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Mon Mar 04 16:06:01 GMT 2024 - 64.3K bytes - Viewed (0) -
guava/src/com/google/common/base/CharMatcher.java
* * <p>This implementation tries to be smart in a number of ways. It recognizes cases where the * negation is cheaper to precompute than the matcher itself; it tries to build small hash tables * for matchers that only match a few characters, and so on. In the worst-case scenario, it * constructs an eight-kilobyte bit array and queries that. In many situations this produces a
Java - Registered: Fri Apr 05 12:43:09 GMT 2024 - Last Modified: Fri Feb 09 15:49:48 GMT 2024 - 53.8K bytes - Viewed (0) -
guava/src/com/google/common/cache/CacheBuilder.java
} /** * Sets the minimum total size for the internal hash tables. For example, if the initial capacity * is {@code 60}, and the concurrency level is {@code 8}, then eight segments are created, each * having a hash table of size eight. Providing a large enough estimate at construction time
Java - Registered: Fri Apr 05 12:43:09 GMT 2024 - Last Modified: Thu Feb 15 16:12:13 GMT 2024 - 51.3K bytes - Viewed (0) -
src/main/java/jcifs/smb/SmbFile.java
protected static final int ATTR_SET_MASK = 0x30A7; protected static final int DEFAULT_ATTR_EXPIRATION_PERIOD = 5000; protected static final int HASH_DOT = ".".hashCode(); protected static final int HASH_DOT_DOT = "..".hashCode(); private static Logger log = LoggerFactory.getLogger(SmbFile.class); private long createTime; private long lastModified;
Java - Registered: Sun May 05 00:10:10 GMT 2024 - Last Modified: Mon Mar 13 12:00:57 GMT 2023 - 81.6K bytes - Viewed (0)