- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 181 for Hodges (0.21 sec)
-
maven-compat/src/main/java/org/apache/maven/repository/metadata/MetadataGraph.java
List<MetadataGraphEdge> edges = getIncidentEdges(vTo); if (edges == null || edges.isEmpty()) { return null; } List<MetadataGraphEdge> res = new ArrayList<>(edges.size()); for (MetadataGraphEdge e : edges) { if (e.getSource().equals(vFrom)) { res.add(e); }
Java - Registered: Sun Apr 28 03:35:10 GMT 2024 - Last Modified: Thu Oct 05 18:41:13 GMT 2023 - 13.1K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/graph/NetworkMutationTest.java
assertThat(network.nodes()).hasSize(NUM_NODES - numNodesToRemove); // Number of edges remaining is unknown (node's incident edges have been removed). AbstractNetworkTest.validateNetwork(network); for (int i = numNodesToRemove; i < NUM_NODES; ++i) { assertThat(network.removeNode(nodeList.get(i))).isTrue(); } assertThat(network.nodes()).isEmpty();
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed Apr 10 19:42:18 GMT 2024 - 4.5K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/ValueGraph.java
* <li>graphs that do/don't allow self-loops * <li>graphs whose nodes/edges are insertion-ordered, sorted, or unordered * <li>graphs whose edges have associated values * </ul> * * <p>{@code ValueGraph}, as a subtype of {@code Graph}, explicitly does not support parallel edges, * and forbids implementations or extensions with parallel edges. If you need parallel edges, use
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Jan 22 17:29:38 GMT 2024 - 15K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/graph/AbstractStandardDirectedNetworkTest.java
Set<Integer> nodes = network.nodes(); UnsupportedOperationException e = assertThrows(UnsupportedOperationException.class, () -> nodes.add(N2)); addNode(N1); assertThat(network.nodes()).containsExactlyElementsIn(nodes); } @Override @Test public void edges_checkReturnedSetMutability() { assume().that(graphIsMutable()).isTrue(); Set<String> edges = network.edges();
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed Sep 06 17:04:31 GMT 2023 - 21.2K bytes - Viewed (0) -
guava-tests/test/com/google/common/graph/AbstractStandardDirectedGraphTest.java
@Override @Test public void nodes_checkReturnedSetMutability() { assume().that(graphIsMutable()).isTrue(); Set<Integer> nodes = graph.nodes(); UnsupportedOperationException e = assertThrows(UnsupportedOperationException.class, () -> nodes.add(N2)); addNode(N1); assertThat(graph.nodes()).containsExactlyElementsIn(nodes); } @Override @Test
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Wed Sep 06 17:04:31 GMT 2023 - 14.1K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/graph/AbstractGraphTest.java
assertThat(graph.nodes()).contains(N1); } @Test public void addNode_existingNode() { assume().that(graphIsMutable()).isTrue(); addNode(N1); ImmutableSet<Integer> nodes = ImmutableSet.copyOf(graph.nodes()); assertThat(graphAsMutableGraph.addNode(N1)).isFalse(); assertThat(graph.nodes()).containsExactlyElementsIn(nodes); } @Test
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Mon Jan 22 17:29:38 GMT 2024 - 16.6K bytes - Viewed (0) -
guava-tests/test/com/google/common/graph/ElementOrderTest.java
assertThat(graph.nodes()).containsExactly(3, 1, 4).inOrder(); } // The default ordering is INSERTION unless otherwise specified. @Test public void nodeOrder_default() { MutableGraph<Integer> graph = GraphBuilder.directed().build(); addNodes(graph); assertThat(graph.nodeOrder()).isEqualTo(insertion()); assertThat(graph.nodes()).containsExactly(3, 1, 4).inOrder(); }
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Mon Oct 10 19:45:10 GMT 2022 - 8.1K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/SuccessorsFunction.java
@DoNotMock("Implement with a lambda, or use GraphBuilder to build a Graph with the desired edges") @ElementTypesAreNonnullByDefault public interface SuccessorsFunction<N> { /** * Returns all nodes in this graph adjacent to {@code node} which can be reached by traversing * {@code node}'s outgoing edges in the direction (if any) of the edge. * * <p>This is <i>not</i> the same as "all nodes reachable from {@code node} by following outgoing
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Apr 26 17:43:39 GMT 2021 - 4.3K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/graph/StandardImmutableGraphAdditionalTest.java
assertThat(graph.nodes()).containsExactly("A"); assertThat(graph.edges()).isEmpty(); } @Test public void immutableGraphBuilder_putEdgeFromNodes() { ImmutableGraph<String> graph = GraphBuilder.directed().<String>immutable().putEdge("A", "B").build(); assertThat(graph.nodes()).containsExactly("A", "B"); assertThat(graph.edges()).containsExactly(EndpointPair.ordered("A", "B"));
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Thu Jan 09 20:24:43 GMT 2020 - 4.5K bytes - Viewed (0) -
guava-tests/test/com/google/common/graph/EndpointPairTest.java
assertThat(edges).hasSize(2); assertThat(edges).contains(EndpointPair.unordered(N1, N1)); assertThat(edges).contains(EndpointPair.unordered(N1, N2)); assertThat(edges).contains(EndpointPair.unordered(N2, N1)); // equal to unordered(N1, N2) // ordered endpoints not compatible with undirected graph assertThat(edges).doesNotContain(EndpointPair.ordered(N1, N2));
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Wed Sep 06 17:04:31 GMT 2023 - 9.4K bytes - Viewed (0)