- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 48 for addTag (0.39 sec)
-
android/guava/src/com/google/common/collect/LinkedHashMultimap.java
* {@code asMap} has a few subtleties. As long as the set of keys remains unchanged, adding or * removing mappings does not affect the key iteration order. However, if you remove all values * associated with a key and then add the key back to the multimap, that key will come last in the * key iteration order. * * <p>The multimap does not store duplicate key-value pairs. Adding a new key-value pair equal to an * existing key-value pair has no effect. *
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Thu Feb 22 21:19:52 GMT 2024 - 23.6K bytes - Viewed (0) -
guava/src/com/google/common/collect/CompactLinkedHashSet.java
import org.checkerframework.checker.nullness.qual.Nullable; /** * CompactLinkedHashSet is an implementation of a Set, which a predictable iteration order that * matches the insertion order. All optional operations (adding and removing) are supported. All * elements, including {@code null}, are permitted. * * <p>{@code contains(x)}, {@code add(x)} and {@code remove(x)}, are all (expected and amortized)
Java - Registered: Fri Apr 05 12:43:09 GMT 2024 - Last Modified: Mon Feb 05 21:38:59 GMT 2024 - 9.7K bytes - Viewed (0) -
guava-tests/test/com/google/common/collect/ListsImplTest.java
ImmutableList.of("A"), ImmutableList.of("A"), ImmutableList.of("A", "A", "B", "C"), ImmutableList.of("A", "A", "D", "E", "B", "C")); String format = "Adding %s at %s"; for (int i = 0; i < toAdd.size(); i++) { int index = indexes.get(i); Iterable<String> iterableToAdd = toAdd.get(i); boolean expectedChanged = iterableToAdd.iterator().hasNext();
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Mon Feb 26 16:35:21 GMT 2024 - 10.6K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/TreeMultiset.java
if (result[0] == 0) { distinctElements++; } this.totalCount += count; return (right.height == initHeight) ? this : rebalance(); } // adding count to me! No rebalance possible. result[0] = elemCount; long resultCount = (long) elemCount + count; checkArgument(resultCount <= Integer.MAX_VALUE); this.elemCount += count;
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Apr 01 16:15:01 GMT 2024 - 34.2K bytes - Viewed (0) -
android/guava/src/com/google/common/math/LongMath.java
/* * lowasser, 2015-Feb-12: Benchmarks suggest that changing this to UnsignedLongs.remainder * and increasing the threshold to 2^32 doesn't pay for itself, and adding another enum * constant hurts performance further -- I suspect because bimorphic implementation is a * sweet spot for the JVM. */ return (a * b) % m; }
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Wed Feb 07 17:50:39 GMT 2024 - 44.6K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/ImmutableSortedMap.java
*/ private static <K, V> ImmutableSortedMap<K, V> fromEntries( Comparator<? super K> comparator, boolean sameComparator, Iterable<? extends Entry<? extends K, ? extends V>> entries) { // "adding" type params to an array of a raw type should be safe as // long as no one can ever cast that same array instance back to a // raw type. @SuppressWarnings("unchecked")
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/util/concurrent/ExecutionList.java
checkNotNull(runnable, "Runnable was null."); checkNotNull(executor, "Executor was null."); // Lock while we check state. We must maintain the lock while adding the new pair so that // another thread can't run the list out from under us. We only add to the list if we have not // yet started execution. synchronized (this) { if (!executed) {
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Apr 22 21:17:24 GMT 2024 - 6.9K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/ArrayListMultimap.java
* * <p>When iterating through the collections supplied by this class, the ordering of values for a * given key agrees with the order in which the values were added. * * <p>This multimap allows duplicate key-value pairs. After adding a new key-value pair equal to an * existing key-value pair, the {@code ArrayListMultimap} will contain entries for both the new * value and the old value. *
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Mon Apr 01 16:15:01 GMT 2024 - 6.9K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/TreeMultimap.java
* keys according to the above key ordering, and for each key they iterate across the values * according to the value ordering. * * <p>The multimap does not store duplicate key-value pairs. Adding a new key-value pair equal to an * existing key-value pair has no effect. * * <p>Null keys and values are permitted (provided, of course, that the respective comparators
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Sat Mar 09 00:21:17 GMT 2024 - 8.7K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/collect/ListsImplTest.java
Collections.singletonList("A"), ImmutableList.of("A"), ImmutableList.of("A", "A", "B", "C"), ImmutableList.of("A", "A", "D", "E", "B", "C")); String format = "Adding %s at %s"; for (int i = 0; i < toAdd.size(); i++) { int index = indexes.get(i); Iterable<String> iterableToAdd = toAdd.get(i); boolean expectedChanged = iterableToAdd.iterator().hasNext();
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Mon Feb 26 16:35:21 GMT 2024 - 10.6K bytes - Viewed (0)