- Sort Score
- Result 10 results
- Languages All
Results 31 - 40 of 217 for Tretter (0.14 sec)
-
android/guava/src/com/google/common/hash/Hashing.java
* HashFunction} instance may use memory proportional to this integer. * @return a hash function, described above, that produces hash codes of length {@code * minimumBits} or greater */ public static HashFunction goodFastHash(int minimumBits) { int bits = checkPositiveAndMakeMultipleOf32(minimumBits); if (bits == 32) { return Murmur3_32HashFunction.GOOD_FAST_HASH_32; }
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/src/com/google/common/util/concurrent/Monitor.java
// monitor.enterXXX()/monitor.leave() will make it really clear // which lock is held at any point in the code. // // 3. I think "enterWhen(notEmpty)" reads better than "notEmpty.enter()". // // TODO(user): Implement ReentrantLock features: // - toString() method // - getOwner() method // - getQueuedThreads() method // - getWaitingThreads(Guard) method
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Dec 04 18:22:01 GMT 2023 - 38.6K bytes - Viewed (0) -
guava/src/com/google/common/collect/ImmutableSortedMap.java
} /** * Not supported. Use {@link #naturalOrder}, which offers better type-safety, instead. This method * exists only to hide {@link ImmutableMap#builder} from consumers of {@code ImmutableSortedMap}. * * @throws UnsupportedOperationException always * @deprecated Use {@link ImmutableSortedMap#naturalOrder}, which offers better type-safety. */ @DoNotCall("Use naturalOrder") @Deprecated
Java - Registered: Fri Apr 05 12:43:09 GMT 2024 - Last Modified: Thu Feb 22 21:19:52 GMT 2024 - 50.3K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/TopKSelector.java
private final @Nullable T[] buffer; private int bufferSize; /** * The largest of the lowest k elements we've seen so far relative to this comparator. If * bufferSize ≥ k, then we can ignore any elements greater than this value. */ @CheckForNull private T threshold; @SuppressWarnings("unchecked") // TODO(cpovirk): Consider storing Object[] instead of T[]. private TopKSelector(Comparator<? super T> comparator, int k) {
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Apr 01 16:15:01 GMT 2024 - 11.2K bytes - Viewed (0) -
guava-testlib/src/com/google/common/collect/testing/TestSortedSetGenerator.java
/** * Returns an element less than the {@link #samples()} but greater than {@link * #belowSamplesLesser()}. */ E belowSamplesGreater(); /** * Returns an element greater than the {@link #samples()} but less than {@link * #aboveSamplesGreater()}. */ E aboveSamplesLesser(); /** * Returns an element greater than the {@link #samples()} and greater than {@link * #aboveSamplesLesser()}. */
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Wed Feb 21 16:49:06 GMT 2024 - 1.7K bytes - Viewed (0) -
android/guava-testlib/src/com/google/common/collect/testing/TestSortedSetGenerator.java
/** * Returns an element less than the {@link #samples()} but greater than {@link * #belowSamplesLesser()}. */ E belowSamplesGreater(); /** * Returns an element greater than the {@link #samples()} but less than {@link * #aboveSamplesGreater()}. */ E aboveSamplesLesser(); /** * Returns an element greater than the {@link #samples()} and greater than {@link * #aboveSamplesLesser()}. */
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed Feb 21 16:49:06 GMT 2024 - 1.7K bytes - Viewed (0) -
android/guava-testlib/src/com/google/common/collect/testing/TestSortedMapGenerator.java
* key of {@link #belowSamplesLesser()}. */ Entry<K, V> belowSamplesGreater(); /** * Returns an entry with a key greater than the keys of the {@link #samples()} but less than the * key of {@link #aboveSamplesGreater()}. */ Entry<K, V> aboveSamplesLesser(); /**
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed Feb 21 16:49:06 GMT 2024 - 1.9K bytes - Viewed (0) -
guava/src/com/google/common/cache/Striped64.java
* failed CAS on base update), the table is initialized to size 2. * The table size is doubled upon further contention until * reaching the nearest power of two greater than or equal to the * number of CPUS. Table slots remain empty (null) until they are * needed. * * A single spinlock ("busy") is used for initializing and
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/HashFunction.java
* perform better than its longhand equivalent, but should not perform worse. * * @since 12.0 */ HashCode hashInt(int input); /** * Shortcut for {@code newHasher().putLong(input).hash()}; returns the hash code for the given * {@code long} value, interpreted in little-endian byte order. The implementation <i>might</i>
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Tue May 25 18:22:59 GMT 2021 - 10.9K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/ComparisonChain.java
return (result < 0) ? LESS : (result > 0) ? GREATER : ACTIVE; } @Override public int result() { return 0; } }; private static final ComparisonChain LESS = new InactiveComparisonChain(-1); private static final ComparisonChain GREATER = new InactiveComparisonChain(1);
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Mon Jan 24 17:47:51 GMT 2022 - 9.3K bytes - Viewed (0)