- Sort Score
- Result 10 results
- Languages All
Results 91 - 100 of 131 for Hedger (0.29 sec)
-
android/guava/src/com/google/common/graph/IncidentEdgeSet.java
* limitations under the License. */ package com.google.common.graph; import java.util.AbstractSet; import java.util.Set; import javax.annotation.CheckForNull; /** * Abstract base class for an incident edges set that allows different implementations of {@link * AbstractSet#iterator()}. */ @ElementTypesAreNonnullByDefault abstract class IncidentEdgeSet<N> extends AbstractSet<EndpointPair<N>> { final N node;
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Apr 26 17:43:39 GMT 2021 - 2.3K bytes - Viewed (0) -
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) -
guava-tests/test/com/google/common/graph/AbstractStandardDirectedNetworkTest.java
} @Override @Test public void edges_checkReturnedSetMutability() { assume().that(graphIsMutable()).isTrue(); Set<String> edges = network.edges(); UnsupportedOperationException e = assertThrows(UnsupportedOperationException.class, () -> edges.add(E12)); addEdge(N1, N2, E12); assertThat(network.edges()).containsExactlyElementsIn(edges); } @Override @Test
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) -
android/guava/src/com/google/common/graph/Graphs.java
for (N node : graph.nodes()) { copy.addNode(node); } for (EndpointPair<N> edge : graph.edges()) { copy.putEdge(edge.nodeU(), edge.nodeV()); } return copy; } /** Creates a mutable copy of {@code graph} with the same nodes, edges, and edge values. */ public static <N, V> MutableValueGraph<N, V> copyOf(ValueGraph<N, V> graph) { MutableValueGraph<N, V> copy =
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) -
maven-compat/src/main/java/org/apache/maven/repository/metadata/DefaultGraphConflictResolver.java
Java - Registered: Sun May 05 03:35:11 GMT 2024 - Last Modified: Wed Sep 06 11:28:54 GMT 2023 - 8.2K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/AbstractNetwork.java
@Override public Set<E> adjacentEdges(E edge) { EndpointPair<N> endpointPair = incidentNodes(edge); // Verifies that edge is in this network. Set<E> endpointPairIncidentEdges = Sets.union(incidentEdges(endpointPair.nodeU()), incidentEdges(endpointPair.nodeV())); return edgeInvalidatableSet( Sets.difference(endpointPairIncidentEdges, ImmutableSet.of(edge)), edge); } @Override
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Wed Mar 13 18:17:09 GMT 2024 - 10.1K bytes - Viewed (0) -
guava-tests/test/com/google/common/graph/AbstractStandardUndirectedNetworkTest.java
} @Override @Test public void edges_checkReturnedSetMutability() { Set<String> edges = network.edges(); UnsupportedOperationException e = assertThrows(UnsupportedOperationException.class, () -> edges.add(E12)); addEdge(N1, N2, E12); assertThat(network.edges()).containsExactlyElementsIn(edges); } @Override @Test
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) -
maven-compat/src/main/java/org/apache/maven/repository/metadata/GraphConflictResolutionPolicy.java
* KIND, either express or implied. See the License for the * specific language governing permissions and limitations * under the License. */ package org.apache.maven.repository.metadata; /** * MetadataGraph edge selection policy. Complements * GraphConflictResolver by being injected into it * * */ @Deprecated public interface GraphConflictResolutionPolicy { String ROLE = GraphConflictResolutionPolicy.class.getName();
Java - Registered: Sun May 05 03:35:11 GMT 2024 - Last Modified: Wed Sep 06 11:28:54 GMT 2023 - 1.1K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/StandardValueGraph.java
private final boolean allowsSelfLoops; private final ElementOrder<N> nodeOrder; final MapIteratorCache<N, GraphConnections<N, V>> nodeConnections; long edgeCount; // must be updated when edges are added or removed /** Constructs a graph with the properties specified in {@code builder}. */ StandardValueGraph(AbstractGraphBuilder<? super N> builder) { this( builder,
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Jan 22 17:29:38 GMT 2024 - 6.1K 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)