- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 12 for Collison (0.41 sec)
-
guava/src/com/google/common/collect/Ordering.java
int leftCode = identityHashCode(left); int rightCode = identityHashCode(right); if (leftCode != rightCode) { return leftCode < rightCode ? -1 : 1; } // identityHashCode collision (rare, but not as rare as you'd think) int result = getUid(left).compareTo(getUid(right)); if (result == 0) { throw new AssertionError(); // extremely, extremely unlikely. }
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Tue May 28 18:11:09 UTC 2024 - 39.4K bytes - Viewed (0) -
android/guava/src/com/google/common/hash/Striped64.java
* * Per-thread hash codes are initialized to random values. * Contention and/or table collisions are indicated by failed * CASes when performing an update operation (see method * retryUpdate). Upon a collision, if the table size is less than * the capacity, it is doubled in size unless some other thread * holds the lock. If a hashed slot is empty, and lock is * available, a new Cell is created. Otherwise, if the slot
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Fri Jun 07 22:25:23 UTC 2024 - 11.5K bytes - Viewed (0) -
android/guava/src/com/google/common/cache/Striped64.java
* * Per-thread hash codes are initialized to random values. * Contention and/or table collisions are indicated by failed * CASes when performing an update operation (see method * retryUpdate). Upon a collision, if the table size is less than * the capacity, it is doubled in size unless some other thread * holds the lock. If a hashed slot is empty, and lock is * available, a new Cell is created. Otherwise, if the slot
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Fri Jun 07 22:25:23 UTC 2024 - 11.5K bytes - Viewed (0) -
guava/src/com/google/common/cache/Striped64.java
* * Per-thread hash codes are initialized to random values. * Contention and/or table collisions are indicated by failed * CASes when performing an update operation (see method * retryUpdate). Upon a collision, if the table size is less than * the capacity, it is doubled in size unless some other thread * holds the lock. If a hashed slot is empty, and lock is * available, a new Cell is created. Otherwise, if the slot
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Fri Jun 07 22:25:23 UTC 2024 - 11.5K bytes - Viewed (0) -
guava-testlib/src/com/google/common/testing/ClassSanityTester.java
// probably intended. So no point in using an equal-but-different factory argument. // We check twice to avoid confusion caused by accidental hash collision. equalArgs.set(i, shouldBeEqualArg); } } return equalArgs; } private static boolean hashCodeInsensitiveToArgReference(
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Tue Jun 11 16:13:05 UTC 2024 - 32.7K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/Ordering.java
int leftCode = identityHashCode(left); int rightCode = identityHashCode(right); if (leftCode != rightCode) { return leftCode < rightCode ? -1 : 1; } // identityHashCode collision (rare, but not as rare as you'd think) int result = getUid(left).compareTo(getUid(right)); if (result == 0) { throw new AssertionError(); // extremely, extremely unlikely. }
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Tue May 28 18:11:09 UTC 2024 - 39.4K bytes - Viewed (0) -
guava/src/com/google/common/hash/Striped64.java
* * Per-thread hash codes are initialized to random values. * Contention and/or table collisions are indicated by failed * CASes when performing an update operation (see method * retryUpdate). Upon a collision, if the table size is less than * the capacity, it is doubled in size unless some other thread * holds the lock. If a hashed slot is empty, and lock is * available, a new Cell is created. Otherwise, if the slot
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Fri Jun 07 22:25:23 UTC 2024 - 11.5K bytes - Viewed (0) -
android/guava/src/com/google/common/base/CharMatcher.java
// TABLE is a precomputed hashset of whitespace characters. MULTIPLIER serves as a hash function // whose key property is that it maps 25 characters into the 32-slot table without collision. // Basically this is an opportunistic fast implementation as opposed to "good code". For most // other use-cases, the reduction in readability isn't worth it. static final String TABLE =
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Fri Feb 09 15:49:48 UTC 2024 - 53.7K bytes - Viewed (0) -
guava-gwt/src-super/com/google/common/collect/super/com/google/common/collect/ImmutableSortedMap.java
SortedMap<K, V> map, Entry<? extends K, ? extends V> entry) { K key = checkNotNull(entry.getKey()); V value = checkNotNull(entry.getValue()); if (map.containsKey(key)) { // When a collision happens, the colliding entry is the first entry // of the tail map. Entry<K, V> previousEntry = map.tailMap(key).entrySet().iterator().next(); throw new IllegalArgumentException(
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Tue Feb 27 19:19:19 UTC 2024 - 16.4K bytes - Viewed (0) -
guava-tests/test/com/google/common/hash/HashTestUtils.java
Assert.assertEquals(0.50d, prob, epsilon); } } } } /** * Checks that a Hasher returns the same HashCode when given the same input, and also that the * collision rate looks sane. */ static void assertInvariants(HashFunction hashFunction) { int objects = 100; Set<HashCode> hashcodes = Sets.newHashSetWithExpectedSize(objects); Random random = new Random(314159);
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Mon Oct 10 19:45:10 UTC 2022 - 25.3K bytes - Viewed (0)