- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 37 for addTag (0.34 sec)
-
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. *
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Mon Apr 01 16:15:01 UTC 2024 - 6.9K bytes - Viewed (0) -
android/guava/src/com/google/common/util/concurrent/MoreExecutors.java
public final class MoreExecutors { private MoreExecutors() {} /** * Converts the given ThreadPoolExecutor into an ExecutorService that exits when the application * is complete. It does so by using daemon threads and adding a shutdown hook to wait for their * completion. * * <p>This is mainly for fixed thread pools. See {@link Executors#newFixedThreadPool(int)}. *
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Wed May 15 10:40:05 UTC 2024 - 39K bytes - Viewed (0) -
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. *
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Thu Feb 22 21:19:52 UTC 2024 - 23.6K 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
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Sat Mar 09 00:21:17 UTC 2024 - 8.7K bytes - Viewed (0) -
guava-gwt/pom.xml
One way to eliminate the warnings is to make base.testModule include the not really necessary <inherits> lines for c.g.c.collect.testModule, etc. However, adding <inherits> lines could make c.g.c.base.testModule transitively inherit from extra modules. If some of those modules are ones that it uses but forgets to list in its own <inherits>, we'd
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Thu Apr 11 15:00:55 UTC 2024 - 19.8K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/ValueGraph.java
* }</pre> * * <p>{@link ValueGraphBuilder#build()} returns an instance of {@link MutableValueGraph}, which is a * subtype of {@code ValueGraph} that provides methods for adding and removing nodes and edges. If * you do not need to mutate a graph (e.g. if you write a method than runs a read-only algorithm on * the graph), you should use the non-mutating {@link ValueGraph} interface, or an {@link
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Mon Jan 22 17:29:38 UTC 2024 - 15K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/ConcurrentHashMultiset.java
return oldValue; } } catch (ArithmeticException overflow) { throw new IllegalArgumentException( "Overflow adding " + occurrences + " occurrences to a count of " + oldValue); } } else { // In the case of a concurrent remove, we might observe a zero value, which means another
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Thu Feb 22 21:19:52 UTC 2024 - 20.9K bytes - Viewed (0) -
android/guava/src/com/google/common/math/Stats.java
* other using {@code second = new StatsAccumulator().addAll(first).snapshot()}, if both were * obtained by calling {@code snapshot()} on the same {@link StatsAccumulator} without adding any * values in between the two calls, or if one is obtained from the other after round-tripping * through java serialization. However, floating point rounding errors mean that it may be false
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Thu Feb 15 16:12:13 UTC 2024 - 22K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/Lists.java
} // LinkedList /** * Creates a <i>mutable</i>, empty {@code LinkedList} instance (for Java 6 and earlier). * * <p><b>Note:</b> if you won't be adding any elements to the list, use {@link ImmutableList#of()} * instead. * * <p><b>Performance note:</b> {@link ArrayList} and {@link java.util.ArrayDeque} consistently
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Thu Feb 29 16:48:36 UTC 2024 - 41.5K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/Graphs.java
GraphBuilder.from(graph).allowsSelfLoops(true).<N>immutable(); // Every node is, at a minimum, reachable from itself. Since the resulting transitive closure // will have no isolated nodes, we can skip adding nodes explicitly and let putEdge() do it. if (graph.isDirected()) { // Note: works for both directed and undirected graphs, but we only use in the directed case. for (N node : graph.nodes()) {
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Mon Apr 01 16:15:01 UTC 2024 - 21.2K bytes - Viewed (0)