- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 11 for Times (0.13 sec)
-
android/guava/src/com/google/common/collect/ImmutableSortedMap.java
* * <p>For <i>small</i> immutable sorted maps, the {@code ImmutableSortedMap.of()} methods are even * more convenient. * * <p>Builder instances can be reused - it is safe to call {@link #buildOrThrow} multiple times to * build multiple maps in series. Each map is a superset of the maps created before it. * * @since 2.0 */ public static class Builder<K, V> extends ImmutableMap.Builder<K, V> {
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed May 01 18:44:57 GMT 2024 - 53.2K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/Multimaps.java
* {@code Set}. * * <p>The function is applied lazily, invoked when needed. This is necessary for the returned * multimap to be a view, but it means that the function will be applied many times for bulk * operations like {@link Multimap#containsValue} and {@code Multimap.toString()}. For this to * perform well, {@code function} should be fast. To avoid lazy evaluation when the returned
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed May 01 18:44:57 GMT 2024 - 86.4K bytes - Viewed (0) -
guava/src/com/google/common/collect/Iterators.java
@Override T transform(@ParametricNullness F from) { return function.apply(from); } }; } /** * Advances {@code iterator} {@code position + 1} times, returning the element at the {@code * position}th position. * * @param position position of the element to return * @return the element at the specified position in {@code iterator}
Java - Registered: Fri Apr 05 12:43:09 GMT 2024 - Last Modified: Tue Jan 30 00:14:39 GMT 2024 - 50.5K bytes - Viewed (0) -
guava/src/com/google/common/collect/ImmutableSortedMap.java
* * <p>For <i>small</i> immutable sorted maps, the {@code ImmutableSortedMap.of()} methods are even * more convenient. * * <p>Builder instances can be reused - it is safe to call {@link #buildOrThrow} multiple times to * build multiple maps in series. Each map is a superset of the maps created before it. * * @since 2.0 */ public static class Builder<K, V> extends ImmutableMap.Builder<K, V> {
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
* nodes. This is an O(n) operation in the common case (and O(n^2) in the worst), but we are saved * by two things. * * <ul> * <li>This is only called when a waiting thread times out or is interrupted. Both of which * should be rare. * <li>The waiters list should be very short. * </ul> */ private void removeWaiter(Waiter node) {
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/base/CharMatcher.java
* query than the original; your mileage may vary. Precomputation takes time and is likely to be * worthwhile only if the precomputed matcher is queried many thousands of times. * * <p>This method has no effect (returns {@code this}) when called in GWT: it's unclear whether a * precomputed matcher is faster, but it certainly consumes more memory, which doesn't seem like a
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Fri Feb 09 15:49:48 GMT 2024 - 53.7K bytes - Viewed (0) -
guava/src/com/google/common/base/CharMatcher.java
* query than the original; your mileage may vary. Precomputation takes time and is likely to be * worthwhile only if the precomputed matcher is queried many thousands of times. * * <p>This method has no effect (returns {@code this}) when called in GWT: it's unclear whether a * precomputed matcher is faster, but it certainly consumes more memory, which doesn't seem like a
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) -
android/guava/src/com/google/common/collect/Sets.java
} @Override public int hashCode() { /* * The sum of the sums of the hash codes in each subset is just the sum of * each input element's hash code times the number of sets that element * appears in. Each element appears in exactly half of the 2^n sets, so: */ return inputSet.keySet().hashCode() << (inputSet.size() - 1); } @Override
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed May 01 18:44:57 GMT 2024 - 77.4K bytes - Viewed (0) -
android/guava/src/com/google/common/util/concurrent/Futures.java
* TimeoutException} wrapped in an {@link ExecutionException}) if the specified duration expires. * * <p>The delegate future is interrupted and cancelled if it times out. * * @param delegate The future to delegate to. * @param unit the time unit of the time parameter * @param scheduledExecutor The executor service to enforce the timeout. * @since 19.0 */
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Apr 01 16:15:01 GMT 2024 - 59.6K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/Iterators.java
@Override T transform(@ParametricNullness F from) { return function.apply(from); } }; } /** * Advances {@code iterator} {@code position + 1} times, returning the element at the {@code * position}th position. * * @param position position of the element to return * @return the element at the specified position in {@code iterator}
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Tue Apr 30 18:43:01 GMT 2024 - 51.1K bytes - Viewed (0)