- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 96 for addons (0.2 sec)
-
guava/src/com/google/common/collect/ImmutableMultisetGwtSerializationDependencies.java
* tries to refer to our dummy serializer for the superclass, * ImmutableMultiset_CustomFieldSerializer. But that type has no methods (since it's never actually * used). We could probably fix the problem by adding dummy methods to that class, but that is * starting to sound harder than taking the superclass approach, which I've been coming to like, * anyway, since it doesn't require us to declare dummy methods (though occasionally constructors)
Java - Registered: Fri Apr 05 12:43:09 GMT 2024 - Last Modified: Tue Jun 01 22:07:10 GMT 2021 - 1.9K bytes - Viewed (0) -
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 Apr 05 12:43:09 GMT 2024 - Last Modified: Mon Apr 01 16:15:01 GMT 2024 - 6.9K bytes - Viewed (0) -
guava-tests/test/com/google/common/graph/AbstractStandardUndirectedNetworkTest.java
assertThat(network.outDegree(N1)).isEqualTo(3); } // Element Mutation @Test public void addEdge_existingNodes() { assume().that(graphIsMutable()).isTrue(); // Adding nodes initially for safety (insulating from possible future // modifications to proxy methods) addNode(N1); addNode(N2); assertThat(networkAsMutableNetwork.addEdge(N1, N2, E12)).isTrue();
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Wed Sep 06 17:04:31 GMT 2023 - 19.3K bytes - Viewed (0) -
guava-tests/test/com/google/common/graph/AbstractStandardDirectedNetworkTest.java
assertThat(network.outDegree(N1)).isEqualTo(2); } // Element Mutation @Test public void addEdge_existingNodes() { assume().that(graphIsMutable()).isTrue(); // Adding nodes initially for safety (insulating from possible future // modifications to proxy methods) addNode(N1); addNode(N2); assertThat(networkAsMutableNetwork.addEdge(N1, N2, E12)).isTrue();
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Wed Sep 06 17:04:31 GMT 2023 - 21.6K bytes - Viewed (0) -
guava/src/com/google/common/collect/AbstractMapBasedMultimap.java
* replace an existing pair with the same key and value, if such a pair is present. With collections * like {@link List} that allow duplicates, the collection will keep the existing key-value pairs * while adding a new pair. * * <p>This class is not threadsafe when any concurrent operations update the multimap, even if the * underlying map and {@link #createCollection()} method return threadsafe classes. Concurrent read
Java - Registered: Fri Apr 05 12:43:09 GMT 2024 - Last Modified: Fri Oct 13 14:11:58 GMT 2023 - 48K bytes - Viewed (0) -
guava-tests/test/com/google/common/graph/GraphsTest.java
import org.junit.Test; import org.junit.runner.RunWith; import org.junit.runners.JUnit4; /** * Tests for {@link Graphs}. Tests assume that the implementation of the method {@code addEdge} adds * the missing nodes to the graph, then adds the edge between them. */ @RunWith(JUnit4.class) public class GraphsTest { private static final Integer N1 = 1; private static final Integer N2 = 2; private static final Integer N3 = 3;
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Wed Sep 06 17:04:31 GMT 2023 - 24.9K 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()) {
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Apr 01 16:15:01 GMT 2024 - 21.2K bytes - Viewed (0) -
guava/src/com/google/common/collect/CompactHashSet.java
import java.util.function.Consumer; import javax.annotation.CheckForNull; import org.checkerframework.checker.nullness.qual.Nullable; /** * CompactHashSet is an implementation of a Set. All optional operations (adding and removing) are * supported. The elements can be any objects. * * <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 - 24.9K 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
XML - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Thu Apr 11 15:00:55 GMT 2024 - 19.8K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/Multimap.java
* * <p>Multimaps are commonly used in places where a {@code Map<K, Collection<V>>} would otherwise * have appeared. The differences include: * * <ul> * <li>There is no need to populate an empty collection before adding an entry with {@link #put * put}. * <li>{@code get} never returns {@code null}, only an empty collection. * <li>A key is contained in the multimap if and only if it maps to at least one value. Any
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Sat Jun 17 14:40:53 GMT 2023 - 15.1K bytes - Viewed (0)