- Sort Score
- Result 10 results
- Languages All
Results 21 - 30 of 53 for fess (0.16 sec)
-
guava-testlib/src/com/google/common/collect/testing/TestSortedSetGenerator.java
/** * Returns an element less than the {@link #samples()} and less than {@link * #belowSamplesGreater()}. */ E belowSamplesLesser(); /** * 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()}.
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()} and less than {@link * #belowSamplesGreater()}. */ E belowSamplesLesser(); /** * 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()}.
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
@Override SortedMap<K, V> create(Object... elements); /** * Returns an entry with a key less than the keys of the {@link #samples()} and less than the key * of {@link #belowSamplesGreater()}. */ Entry<K, V> belowSamplesLesser(); /** * Returns an entry with a key less than the keys of the {@link #samples()} but greater than the * key of {@link #belowSamplesLesser()}. */
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/collect/ImmutableSortedMap.java
return CollectCollectors.toImmutableSortedMap( comparator, keyFunction, valueFunction, mergeFunction); } /* * TODO(kevinb): Confirm that ImmutableSortedMap is faster to construct and * uses less memory than TreeMap; then say so in the class Javadoc. */ private static final Comparator<?> NATURAL_ORDER = Ordering.natural(); private static final ImmutableSortedMap<Comparable<?>, Object> NATURAL_EMPTY_MAP =
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/util/concurrent/AbstractFuture.java
* any of the public methods of ListenableFuture. */ interface Trusted<V extends @Nullable Object> extends ListenableFuture<V> {} /** * A less abstract subclass of AbstractFuture. This can be used to optimize setFuture by ensuring * that {@link #get} calls exactly the implementation of {@link AbstractFuture#get}. */
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Apr 22 21:17:24 GMT 2024 - 63K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/SortedLists.java
int foundIndex) { return LAST_PRESENT.resultIndex(comparator, key, list, foundIndex) + 1; } }, /** * Return the index of the last list element that compares as less than the key, or {@code -1} * if there is no such element. */ LAST_BEFORE { @Override public <E extends @Nullable Object> int resultIndex( Comparator<? super E> comparator,
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Thu Feb 22 21:19:52 GMT 2024 - 10.9K bytes - Viewed (0) -
guava/src/com/google/common/cache/Striped64.java
* 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
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-testlib/src/com/google/common/collect/testing/AbstractIteratorTester.java
|| (stimuli.length >= 5 && removes > 2)) { // removes are the most expensive thing to test, since they often throw exceptions with stack // traces, so we test them a bit less aggressively return; } MultiExceptionListIterator reference = new MultiExceptionListIterator(expectedElements); I target = newTargetIterator(); for (int i = 0; i < stimuli.length; i++) {
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Mon Apr 01 16:15:01 GMT 2024 - 20.7K bytes - Viewed (0) -
guava/src/com/google/common/cache/LocalCache.java
* traverse. When nodes would otherwise be changed, new nodes are created to replace them. This * works well for hash tables since the bin lists tend to be short. (The average length is less * than two.) * * Read operations can thus proceed without locking, but rely on selected uses of volatiles to * ensure that completed write operations performed by other threads are noticed. For most
Java - Registered: Fri Apr 05 12:43:09 GMT 2024 - Last Modified: Thu Feb 22 17:40:56 GMT 2024 - 150.3K bytes - Viewed (0) -
android/guava/src/com/google/common/hash/BloomFilter.java
* @param expectedInsertions the number of expected insertions to the constructed {@code * BloomFilter}; must be positive * @param fpp the desired false positive probability (must be positive and less than 1.0) * @return a {@code BloomFilter} */ public static <T extends @Nullable Object> BloomFilter<T> create( Funnel<? super T> funnel, int expectedInsertions, double fpp) {
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Apr 01 16:15:01 GMT 2024 - 23.1K bytes - Viewed (0)