- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 71 for incidents (0.22 sec)
-
maven-compat/src/main/java/org/apache/maven/repository/MetadataGraphNode.java
import java.util.ArrayList; import java.util.List; /** * MetadataGraph node - as it's a directed graph - holds adjacency lists for incident and exident nodes * * */ @Deprecated public class MetadataGraphNode { /** node payload */ MavenArtifactMetadata metadata; /** nodes, incident to this (depend on me) */ List<MetadataGraphNode> inNodes; /** nodes, exident to this (I depend on) */
Java - Registered: Sun Apr 28 03:35:10 GMT 2024 - Last Modified: Wed Sep 06 11:28:54 GMT 2023 - 2.4K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/graph/GraphsTest.java
directedGraph.putEdge(N1, N2); directedGraph.putEdge(N2, N1); directedGraph.putEdge(N1, N3); // only incident to one node in nodeSubset directedGraph.putEdge(N4, N4); directedGraph.putEdge(5, 6); // not incident to any node in nodeSubset MutableGraph<Integer> expectedSubgraph = GraphBuilder.directed().allowsSelfLoops(true).build(); expectedSubgraph.putEdge(N1, N2);
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed Sep 06 17:04:31 GMT 2023 - 24.8K bytes - Viewed (0) -
guava-tests/test/com/google/common/graph/GraphsTest.java
directedGraph.putEdge(N1, N2); directedGraph.putEdge(N2, N1); directedGraph.putEdge(N1, N3); // only incident to one node in nodeSubset directedGraph.putEdge(N4, N4); directedGraph.putEdge(5, 6); // not incident to any node in nodeSubset MutableGraph<Integer> expectedSubgraph = GraphBuilder.directed().allowsSelfLoops(true).build(); expectedSubgraph.putEdge(N1, N2);
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/StandardValueGraph.java
GraphConnections<N, V> connections = checkedConnections(node); IncidentEdgeSet<N> incident = new IncidentEdgeSet<N>(this, node) { @Override public Iterator<EndpointPair<N>> iterator() { return connections.incidentEdgeIterator(node); } }; return nodeInvalidatableSet(incident, node); } @Override public boolean hasEdgeConnecting(N nodeU, N nodeV) {
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/BaseGraph.java
/** * Returns the count of {@code node}'s incident edges, counting self-loops twice (equivalently, * the number of times an edge touches {@code node}). * * <p>For directed graphs, this is equal to {@code inDegree(node) + outDegree(node)}. * * <p>For undirected graphs, this is equal to {@code incidentEdges(node).size()} + (number of * self-loops incident to {@code node}). *
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Jan 22 17:29:38 GMT 2024 - 8.8K bytes - Viewed (0) -
maven-compat/src/test/java/org/apache/maven/repository/metadata/DefaultGraphConflictResolverTest.java
"wrong # of excident edges in the resulting graph entry after resolver"); assertEquals( 1, res.getIncidentEdges(v2).size(), "wrong # of v2 incident edges in the resulting graph after resolver"); assertEquals( "1.2", res.getIncidentEdges(v2).get(0).getVersion(),
Java - Registered: Sun Apr 28 03:35:10 GMT 2024 - Last Modified: Thu Apr 25 05:46:50 GMT 2024 - 8.1K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/Network.java
* self-loops twice (equivalently, the number of times an edge touches {@code node}). * * <p>For directed networks, this is equal to {@code inDegree(node) + outDegree(node)}. * * <p>For undirected networks, this is equal to {@code incidentEdges(node).size()} + (number of * self-loops incident to {@code node}). *
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Jan 22 17:29:38 GMT 2024 - 21.1K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/AbstractBaseGraph.java
} @Override public Set<EndpointPair<N>> incidentEdges(N node) { checkNotNull(node); checkArgument(nodes().contains(node), "Node %s is not an element of this graph.", node); IncidentEdgeSet<N> incident = new IncidentEdgeSet<N>(this, node) { @Override public UnmodifiableIterator<EndpointPair<N>> iterator() { if (graph.isDirected()) {
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Jan 22 17:29:38 GMT 2024 - 7.2K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/ValueGraph.java
/** * Returns the count of {@code node}'s incident edges, counting self-loops twice (equivalently, * the number of times an edge touches {@code node}). * * <p>For directed graphs, this is equal to {@code inDegree(node) + outDegree(node)}. * * <p>For undirected graphs, this is equal to {@code incidentEdges(node).size()} + (number of * self-loops incident to {@code node}). *
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Jan 22 17:29:38 GMT 2024 - 15K bytes - Viewed (0) -
apache-maven/src/main/appended-resources/licenses/unrecognized-jline-3.25.1.txt
BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED
Plain Text - Registered: Sun Apr 21 03:35:09 GMT 2024 - Last Modified: Mon Jan 29 15:51:24 GMT 2024 - 1.5K bytes - Viewed (0)