- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 19 for allowsSelfLoops (0.17 sec)
-
guava-tests/test/com/google/common/graph/TestUtil.java
assertThat(graphA.allowsSelfLoops()).isEqualTo(graphB.allowsSelfLoops()); assertThat(graphA.nodeOrder()).isEqualTo(graphB.nodeOrder()); assertThat(graphA).isEqualTo(graphB); } static void assertStronglyEquivalent(ValueGraph<?, ?> graphA, ValueGraph<?, ?> graphB) { // Properties not covered by equals() assertThat(graphA.allowsSelfLoops()).isEqualTo(graphB.allowsSelfLoops());
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Mon Jan 22 17:29:38 GMT 2024 - 3.9K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/graph/TestUtil.java
assertThat(graphA.allowsSelfLoops()).isEqualTo(graphB.allowsSelfLoops()); assertThat(graphA.nodeOrder()).isEqualTo(graphB.nodeOrder()); assertThat(graphA).isEqualTo(graphB); } static void assertStronglyEquivalent(ValueGraph<?, ?> graphA, ValueGraph<?, ?> graphB) { // Properties not covered by equals() assertThat(graphA.allowsSelfLoops()).isEqualTo(graphB.allowsSelfLoops());
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Mon Jan 22 17:29:38 GMT 2024 - 3.9K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/StandardValueGraph.java
*/ StandardValueGraph( AbstractGraphBuilder<? super N> builder, Map<N, GraphConnections<N, V>> nodeConnections, long edgeCount) { this.isDirected = builder.directed; this.allowsSelfLoops = builder.allowsSelfLoops; this.nodeOrder = builder.nodeOrder.cast(); // Prefer the heavier "MapRetrievalCache" for nodes if lookup is expensive. this.nodeConnections = (nodeConnections instanceof TreeMap)
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/StandardNetwork.java
Map<N, NetworkConnections<N, E>> nodeConnections, Map<E, N> edgeToReferenceNode) { this.isDirected = builder.directed; this.allowsParallelEdges = builder.allowsParallelEdges; this.allowsSelfLoops = builder.allowsSelfLoops; this.nodeOrder = builder.nodeOrder.cast(); this.edgeOrder = builder.edgeOrder.cast(); // Prefer the heavier "MapRetrievalCache" for nodes if lookup is expensive. This optimizes
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) -
guava-tests/test/com/google/common/graph/ValueGraphTest.java
assertThat(graph.incidentEdgeOrder()).isEqualTo(asGraph.incidentEdgeOrder()); assertThat(graph.isDirected()).isEqualTo(asGraph.isDirected()); assertThat(graph.allowsSelfLoops()).isEqualTo(asGraph.allowsSelfLoops()); for (Integer node : graph.nodes()) { assertThat(graph.adjacentNodes(node)).isEqualTo(asGraph.adjacentNodes(node));
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Tue Feb 06 18:35:19 GMT 2024 - 20K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/AbstractNetwork.java
} @Override public boolean isDirected() { return AbstractNetwork.this.isDirected(); } @Override public boolean allowsSelfLoops() { return AbstractNetwork.this.allowsSelfLoops(); } @Override public Set<N> adjacentNodes(N node) { return AbstractNetwork.this.adjacentNodes(node); } @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/AbstractNetworkTest.java
assertThat(networkString).contains("isDirected: " + network.isDirected()); assertThat(networkString).contains("allowsParallelEdges: " + network.allowsParallelEdges()); assertThat(networkString).contains("allowsSelfLoops: " + network.allowsSelfLoops()); int nodeStart = networkString.indexOf("nodes:"); int edgeStart = networkString.indexOf("edges:"); String nodeString = networkString.substring(nodeStart, edgeStart);
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Mon Jan 22 17:29:38 GMT 2024 - 33K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/graph/AbstractNetworkTest.java
assertThat(networkString).contains("isDirected: " + network.isDirected()); assertThat(networkString).contains("allowsParallelEdges: " + network.allowsParallelEdges()); assertThat(networkString).contains("allowsSelfLoops: " + network.allowsSelfLoops()); int nodeStart = networkString.indexOf("nodes:"); int edgeStart = networkString.indexOf("edges:"); String nodeString = networkString.substring(nodeStart, edgeStart);
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Mon Jan 22 17:29:38 GMT 2024 - 32.7K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/graph/AbstractGraphTest.java
String graphString = graph.toString(); assertThat(graphString).contains("isDirected: " + graph.isDirected()); assertThat(graphString).contains("allowsSelfLoops: " + graph.allowsSelfLoops()); int nodeStart = graphString.indexOf("nodes:"); int edgeStart = graphString.indexOf("edges:"); String nodeString = graphString.substring(nodeStart, edgeStart);
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/NetworkMutationTest.java
for (int trial = 0; trial < NUM_TRIALS; ++trial) { MutableNetwork<Integer, Object> network = networkBuilder.allowsParallelEdges(true).allowsSelfLoops(true).build(); assertThat(network.nodes()).isEmpty(); assertThat(network.edges()).isEmpty(); AbstractNetworkTest.validateNetwork(network); while (network.nodes().size() < NUM_NODES) {
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Wed Apr 10 19:42:18 GMT 2024 - 4.5K bytes - Viewed (0)