- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 66 for Hedger (0.2 sec)
-
guava-tests/test/com/google/common/graph/GraphMutationTest.java
assertThat(graph.nodes()).hasSize(NUM_NODES); assertThat(graph.edges()).hasSize(NUM_EDGES); AbstractGraphTest.validateGraph(graph); Collections.shuffle(edgeList, gen); int numEdgesToRemove = gen.nextInt(NUM_EDGES); for (int i = 0; i < numEdgesToRemove; ++i) { EndpointPair<Integer> edge = edgeList.get(i);
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Fri Aug 18 16:17:46 GMT 2017 - 4.2K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/GraphConstants.java
static final String REUSING_EDGE = "Edge %s already exists between the following nodes: %s, " + "so it cannot be reused to connect the following nodes: %s."; static final String MULTIPLE_EDGES_CONNECTING = "Cannot call edgeConnecting() when parallel edges exist between %s and %s. Consider calling " + "edgesConnecting() instead."; static final String PARALLEL_EDGES_NOT_ALLOWED =
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Jan 22 17:29:38 GMT 2024 - 3.1K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/EdgesConnecting.java
import javax.annotation.CheckForNull; /** * A class to represent the set of edges connecting an (implicit) origin node to a target node. * * <p>The {@link #nodeToOutEdge} map means this class only works on networks without parallel edges. * See {@link MultiEdgesConnecting} for a class that works with parallel edges. * * @author James Sexton * @param <E> Edge parameter type */ @ElementTypesAreNonnullByDefault
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Apr 26 17:43:39 GMT 2021 - 2.2K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/AbstractValueGraph.java
+ nodes() + ", edges: " + edgeValueMap(this); } private static <N, V> Map<EndpointPair<N>, V> edgeValueMap(final ValueGraph<N, V> graph) { return Maps.asMap( graph.edges(), edge -> // requireNonNull is safe because the endpoint pair comes from the graph. requireNonNull(graph.edgeValueOrDefault(edge.nodeU(), edge.nodeV(), null))); }
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Apr 17 13:59:28 GMT 2023 - 4K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/StandardNetwork.java
} return connections; } final N checkedReferenceNode(E edge) { N referenceNode = edgeToReferenceNode.get(edge); if (referenceNode == null) { checkNotNull(edge); throw new IllegalArgumentException(String.format(EDGE_NOT_IN_GRAPH, edge)); } return referenceNode; } final boolean containsNode(N node) {
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Jan 22 17:29:38 GMT 2024 - 6.9K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/AbstractGraphBuilder.java
Optional<Integer> expectedNodeCount = Optional.absent(); /** * Creates a new instance with the specified edge directionality. * * @param directed if true, creates an instance for graphs whose edges are each directed; if * false, creates an instance for graphs whose edges are each undirected. */ AbstractGraphBuilder(boolean directed) { this.directed = directed; }
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Apr 26 17:43:39 GMT 2021 - 1.4K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/DirectedMultiNetworkConnections.java
@Override public N removeInEdge(E edge, boolean isSelfLoop) { N node = super.removeInEdge(edge, isSelfLoop); Multiset<N> predecessors = getReference(predecessorsReference); if (predecessors != null) { checkState(predecessors.remove(node)); } return node; } @Override public N removeOutEdge(E edge) { N node = super.removeOutEdge(edge);
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Wed Oct 06 00:47:57 GMT 2021 - 4.6K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/MutableNetwork.java
* #allowsParallelEdges()} or {@link #allowsSelfLoops()} */ @CanIgnoreReturnValue boolean addEdge(N nodeU, N nodeV, E edge); /** * Adds {@code edge} connecting {@code endpoints}. In an undirected network, {@code edge} will * also connect {@code nodeV} to {@code nodeU}. *
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Apr 26 17:43:39 GMT 2021 - 4.4K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/StandardMutableGraph.java
@Override public boolean addNode(N node) { return backingValueGraph.addNode(node); } @Override public boolean putEdge(N nodeU, N nodeV) { return backingValueGraph.putEdgeValue(nodeU, nodeV, Presence.EDGE_EXISTS) == null; } @Override public boolean putEdge(EndpointPair<N> endpoints) { validateEndpoints(endpoints); return putEdge(endpoints.nodeU(), endpoints.nodeV()); } @Override
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Apr 26 17:43:39 GMT 2021 - 2.4K bytes - Viewed (0) -
android/guava/src/com/google/common/reflect/AbstractInvocationHandler.java
} private static boolean isProxyOfSameInterfaces(Object arg, Class<?> proxyClass) { return proxyClass.isInstance(arg) // Equal proxy instances should mostly be instance of proxyClass // Under some edge cases (such as the proxy of JDK types serialized and then deserialized) // the proxy type may not be the same. // We first check isProxyClass() so that the common case of comparing with non-proxy objects
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Wed Jan 05 17:43:40 GMT 2022 - 5.2K bytes - Viewed (0)