- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 29 for Slot (0.18 sec)
-
android/guava/src/com/google/common/cache/Striped64.java
* 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 * exists, a CAS is tried. Retries proceed by "double hashing", * using a secondary hash (Marsaglia XorShift) to try to find a * free slot. * * The table size is capped because, when there are more threads
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Thu Feb 22 17:40:56 GMT 2024 - 11.5K bytes - Viewed (0) -
guava/src/com/google/common/cache/Striped64.java
* 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 * exists, a CAS is tried. Retries proceed by "double hashing", * using a secondary hash (Marsaglia XorShift) to try to find a * free slot. * * The table size is capped because, when there are more threads
Java - Registered: Fri Apr 05 12:43:09 GMT 2024 - Last Modified: Thu Feb 22 17:40:56 GMT 2024 - 11.5K bytes - Viewed (0) -
android/guava/src/com/google/common/hash/Striped64.java
* 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 * exists, a CAS is tried. Retries proceed by "double hashing", * using a secondary hash (Marsaglia XorShift) to try to find a * free slot. * * The table size is capped because, when there are more threads
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Thu Feb 22 17:40:56 GMT 2024 - 11.5K bytes - Viewed (0) -
android/guava/src/com/google/common/util/concurrent/Striped.java
// We only ever register ArrayReferences with the queue so this is always safe. ArrayReference<? extends L> arrayRef = (ArrayReference<? extends L>) ref; // Try to clear out the array slot, n.b. if we fail that is fine, in either case the // arrayRef will be out of the array after this step. locks.compareAndSet(arrayRef.index, arrayRef, null); } } @Override
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/base/CharMatcher.java
static final class Whitespace extends NamedFastMatcher { // 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 =
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Fri Feb 09 15:49:48 GMT 2024 - 53.7K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/collect/HashMultisetTest.java
assertEquals(2, copy.size()); assertSame(copy, copy.iterator().next().member); } /* * The behavior of toString() and iteration is tested by LinkedHashMultiset, * which shares a lot of code with HashMultiset and has deterministic * iteration order. */
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Feb 19 20:34:55 GMT 2024 - 4.4K bytes - Viewed (0) -
android/guava/src/com/google/common/base/Preconditions.java
* string formatting itself should not be a concern. * * <p>As with any performance concerns, you should consider profiling your code (in a production * environment if possible) before spending a lot of effort on tweaking a particular element. * * <h3>Other types of preconditions</h3> * * <p>Not every type of precondition failure is supported by these methods. Continue to throw
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Thu Apr 11 11:52:14 GMT 2024 - 52.9K bytes - Viewed (0) -
android/guava/src/com/google/common/primitives/Ints.java
// fgha[c]|[b]de -> fgha[b]|[c]de. Because these two blocks are the same size, we are done. // The Dolphin algorithm is attractive because it does the fewest array reads and writes: each // array slot is read and written exactly once. However, it can have very poor memory locality: // benchmarking shows it can take 7 times longer than the other two in some cases. The other two
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Thu Feb 15 16:12:13 GMT 2024 - 29.7K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/ImmutableSet.java
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; table[index] = element; hashCode += hash; break; } else if (value.equals(element)) { break;
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/base/CharMatcher.java
static final class Whitespace extends NamedFastMatcher { // 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 =
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)