- Sort Score
- Result 10 results
- Languages All
Results 11 - 20 of 173 for Haddad (0.15 sec)
-
android/guava-tests/test/com/google/common/collect/AbstractImmutableSetTest.java
ImmutableSet<String> set = this.<String>builder().addAll(a).addAll(b).build(); assertThat(set).containsExactly("a", "b", "c", "d", "e").inOrder(); } static final int LAST_COLOR_ADDED = 0x00BFFF; public void testComplexBuilder() { List<Integer> colorElem = asList(0x00, 0x33, 0x66, 0x99, 0xCC, 0xFF); // javac won't compile this without "this.<Integer>"
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Thu Mar 07 18:34:03 GMT 2024 - 18.7K bytes - Viewed (0) -
guava/src/com/google/common/cache/Cache.java
import java.util.concurrent.ConcurrentMap; import java.util.concurrent.ExecutionException; import javax.annotation.CheckForNull; /** * A semi-persistent mapping from keys to values. Cache entries are manually added using {@link * #get(Object, Callable)} or {@link #put(Object, Object)}, and are stored in the cache until either * evicted or manually invalidated. The common way to build instances is using {@link CacheBuilder}. *
Java - Registered: Fri Apr 05 12:43:09 GMT 2024 - Last Modified: Sun Aug 07 02:38:22 GMT 2022 - 7.9K bytes - Viewed (1) -
android/guava-tests/test/com/google/common/collect/ImmutableSetTest.java
} @Override <E extends Comparable<E>> Builder<E> builder() { return ImmutableSet.builder(); } @Override int getComplexBuilderSetLastElement() { return LAST_COLOR_ADDED; } public void testEquals() { new EqualsTester() .addEqualityGroup(ImmutableSet.of(), ImmutableSet.of()) .addEqualityGroup(ImmutableSet.of(1), ImmutableSet.of(1), ImmutableSet.of(1, 1))
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Tue Feb 20 17:00:05 GMT 2024 - 13.7K bytes - Viewed (0) -
guava/src/com/google/common/collect/ImmutableRangeMap.java
Builder<K, V> combine(Builder<K, V> builder) { entries.addAll(builder.entries); return this; } /** * Returns an {@code ImmutableRangeMap} containing the associations previously added to this * builder. * * @throws IllegalArgumentException if any two ranges inserted into this builder overlap */ public ImmutableRangeMap<K, V> build() {
Java - Registered: Fri Apr 05 12:43:09 GMT 2024 - Last Modified: Mon Apr 01 16:15:01 GMT 2024 - 14.7K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/HashBiMap.java
} else { prevInInsertionOrder[next] = prev; } } /** * Updates the K-to-V hash table to include the entry at the specified index, which is assumed to * have not yet been added. */ private void insertIntoTableKToV(int entry, int keyHash) { checkArgument(entry != ABSENT); int keyBucket = bucket(keyHash); nextInBucketKToV[entry] = hashTableKToV[keyBucket];
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Mon Mar 06 16:06:58 GMT 2023 - 36.4K bytes - Viewed (0) -
android/guava/src/com/google/common/hash/Hashing.java
* following conditions: * * <ul> * <li>You want to assign the same fraction of inputs to each bucket. * <li>When you reduce the number of buckets, you can accept that the most recently added * buckets will be removed first. More concretely, if you are dividing traffic among tasks, * you can decrease the number of tasks from 15 and 10, killing off the final 5 tasks, and
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/collect/Multisets.java
* inputs, with counts equal to the result of applying {@code countFunction} to the inputs. * Elements are added in encounter order. * * <p>If the mapped elements contain duplicates (according to {@link Object#equals}), the element * will be added more than once, with the count summed over all appearances of the element. *
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed May 01 18:44:57 GMT 2024 - 41.7K bytes - Viewed (0) -
android/guava/src/com/google/common/primitives/ImmutableIntArray.java
* {@code initialCapacity} values without resizing. The returned builder is not thread-safe. * * <p><b>Performance note:</b> When feasible, {@code initialCapacity} should be the exact number * of values that will be added, if that knowledge is readily available. It is better to guess a * value slightly too high than slightly too low. If the value is not exact, the {@link
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Fri May 12 16:34:24 GMT 2023 - 18.9K bytes - Viewed (0) -
android/guava/src/com/google/common/util/concurrent/FluentFuture.java
* computation is already complete, immediately. * * <p>The callback is run on {@code executor}. There is no guaranteed ordering of execution of * callbacks, but any callback added through this method is guaranteed to be called once the * computation is complete. * * <p>Example: * * <pre>{@code * future.addCallback( * new FutureCallback<QueryResult>() {
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Tue Apr 11 19:08:44 GMT 2023 - 18.7K bytes - Viewed (0) -
android/guava/src/com/google/common/primitives/ImmutableDoubleArray.java
* {@code initialCapacity} values without resizing. The returned builder is not thread-safe. * * <p><b>Performance note:</b> When feasible, {@code initialCapacity} should be the exact number * of values that will be added, if that knowledge is readily available. It is better to guess a * value slightly too high than slightly too low. If the value is not exact, the {@link
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Fri May 12 16:34:24 GMT 2023 - 19.6K bytes - Viewed (0)