- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 14 for smear (0.17 sec)
-
android/guava-tests/test/com/google/common/collect/HashingTest.java
assertEquals(587718043, smear(-1728529858)); assertEquals(1757836855, smear(-938301587)); assertEquals(1002498708, smear(1431162155)); assertEquals(52905316, smear(1085665355)); assertEquals(-1590037357, smear(1654374947)); assertEquals(-100883544, smear(-1661998771)); assertEquals(1312247346, smear(-65105105)); assertEquals(-79641824, smear(-73789608));
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Feb 19 20:34:55 GMT 2024 - 5.9K bytes - Viewed (0) -
guava-tests/test/com/google/common/collect/HashingTest.java
assertEquals(587718043, smear(-1728529858)); assertEquals(1757836855, smear(-938301587)); assertEquals(1002498708, smear(1431162155)); assertEquals(52905316, smear(1085665355)); assertEquals(-1590037357, smear(1654374947)); assertEquals(-100883544, smear(-1661998771)); assertEquals(1312247346, smear(-65105105)); assertEquals(-79641824, smear(-73789608));
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Mon Feb 19 20:34:55 GMT 2024 - 5.9K bytes - Viewed (0) -
guava/src/com/google/common/base/SmallCharMatcher.java
* following header: * * MurmurHash3 was written by Austin Appleby, and is placed in the public domain. The author * hereby disclaims copyright to this source code. */ static int smear(int hashCode) { return C2 * Integer.rotateLeft(hashCode * C1, 15); } private boolean checkFilter(int c) { return 1 == (1 & (filter >> c)); }
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) -
android/guava/src/com/google/common/collect/RegularImmutableMap.java
* double the index of the entry in entrySet.asList.) * * The basic data structure is described in https://en.wikipedia.org/wiki/Open_addressing. * The pointer to a key is stored in hashTable[Hashing.smear(key.hashCode()) % table.length], * save that if that location is already full, we try the next index, and the next, until we * find an empty table position. Since the table has a power-of-two size, we use
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Apr 15 22:32:14 GMT 2024 - 22.7K bytes - Viewed (0) -
android/guava/src/com/google/common/base/SmallCharMatcher.java
* following header: * * MurmurHash3 was written by Austin Appleby, and is placed in the public domain. The author * hereby disclaims copyright to this source code. */ static int smear(int hashCode) { return C2 * Integer.rotateLeft(hashCode * C1, 15); } private boolean checkFilter(int c) { return 1 == (1 & (filter >> c)); }
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Fri Feb 09 15:49:48 GMT 2024 - 4.5K bytes - Viewed (0) -
guava/src/com/google/common/collect/Hashing.java
* hereby disclaims copyright to this source code. */ static int smear(int hashCode) { return (int) (C2 * Integer.rotateLeft((int) (hashCode * C1), 15)); } static int smearedHash(@CheckForNull Object o) { return smear((o == null) ? 0 : o.hashCode()); } private static final int MAX_TABLE_SIZE = Ints.MAX_POWER_OF_TWO;
Java - Registered: Fri Apr 05 12:43:09 GMT 2024 - Last Modified: Thu Aug 05 00:40:25 GMT 2021 - 2.5K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/Hashing.java
* hereby disclaims copyright to this source code. */ static int smear(int hashCode) { return (int) (C2 * Integer.rotateLeft((int) (hashCode * C1), 15)); } static int smearedHash(@CheckForNull Object o) { return smear((o == null) ? 0 : o.hashCode()); } private static final int MAX_TABLE_SIZE = Ints.MAX_POWER_OF_TWO;
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Thu Aug 05 00:40:25 GMT 2021 - 2.5K bytes - Viewed (0) -
android/guava/src/com/google/common/util/concurrent/Striped.java
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Apr 10 20:55:18 GMT 2023 - 20.3K bytes - Viewed (1) -
android/guava/src/com/google/common/collect/ImmutableSet.java
int hashCode = 0; int uniques = 0; for (int i = 0; i < n; i++) { Object element = checkElementNotNull(elements[i], i); int hash = element.hashCode(); for (int j = Hashing.smear(hash); ; j++) { int index = j & mask; Object value = table[index]; if (value == null) { // Came to an empty slot. Put the element here. elements[uniques++] = element;
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Apr 01 16:15:01 GMT 2024 - 22.4K bytes - Viewed (0) -
guava/src/com/google/common/collect/ImmutableSet.java
} } return insertInHashTable(e); } private SetBuilderImpl<E> insertInHashTable(E e) { requireNonNull(hashTable); int eHash = e.hashCode(); int i0 = Hashing.smear(eHash); int mask = hashTable.length - 1; for (int i = i0; i - i0 < maxRunBeforeFallback; i++) { int index = i & mask; Object tableEntry = hashTable[index]; if (tableEntry == null) {
Java - Registered: Fri Apr 05 12:43:09 GMT 2024 - Last Modified: Mon Apr 01 16:15:01 GMT 2024 - 35.4K bytes - Viewed (0)