- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 104 for Graph (0.15 sec)
-
maven-core/src/main/java/org/apache/maven/internal/impl/Graph.java
* specific language governing permissions and limitations * under the License. */ package org.apache.maven.internal.impl; import java.util.*; import org.apache.maven.project.CycleDetectedException; class Graph { private enum DfsState { VISITING, VISITED } final Map<String, Vertex> vertices = new LinkedHashMap<>(); public Vertex getVertex(String id) { return vertices.get(id);
Java - Registered: Sun May 05 03:35:11 GMT 2024 - Last Modified: Fri Apr 12 10:50:18 GMT 2024 - 4.5K bytes - Viewed (0) -
maven-api-impl/src/main/java/org/apache/maven/internal/impl/model/Graph.java
import java.util.List; import java.util.Map; import java.util.Set; class Graph { final Map<String, Set<String>> graph = new LinkedHashMap<>(); synchronized void addEdge(String from, String to) throws CycleDetectedException { if (graph.computeIfAbsent(from, l -> new HashSet<>()).add(to)) { List<String> cycle = visitCycle(graph, Collections.singleton(to), new HashMap<>(), new LinkedList<>());
Java - Registered: Sun May 05 03:35:11 GMT 2024 - Last Modified: Fri Apr 12 10:50:18 GMT 2024 - 3.3K bytes - Viewed (0) -
maven-core/src/main/java/org/apache/maven/project/Graph.java
* KIND, either express or implied. See the License for the * specific language governing permissions and limitations * under the License. */ package org.apache.maven.project; import java.util.*; class Graph { private enum DfsState { VISITING, VISITED } final Map<String, Vertex> vertices = new LinkedHashMap<>(); public Vertex getVertex(String id) { return vertices.get(id);
Java - Registered: Sun May 05 03:35:11 GMT 2024 - Last Modified: Fri Sep 22 06:02:04 GMT 2023 - 3.9K bytes - Viewed (0) -
maven-compat/src/test/java/org/apache/maven/repository/metadata/DefaultClasspathTransformationTestType.java
* v3-v4 * */ v1 = graph.addVertex(new ArtifactMetadata("g", "a1", "1.0")); graph.setEntry(v1); v2 = graph.addVertex(new ArtifactMetadata("g", "a2", "1.0")); v3 = graph.addVertex(new ArtifactMetadata("g", "a3", "1.0")); v4 = graph.addVertex(new ArtifactMetadata("g", "a4", "1.0")); // v1-->v2 graph.addEdge(v1, v2, new MetadataGraphEdge("1.1", true, null, null, 2, 1));
Java - Registered: Sun May 05 03:35:11 GMT 2024 - Last Modified: Thu Apr 25 05:46:50 GMT 2024 - 4.7K bytes - Viewed (0) -
maven-core/src/main/java/org/apache/maven/project/ProjectSorter.java
import org.apache.maven.api.model.Parent; import org.apache.maven.api.model.Plugin; import org.apache.maven.artifact.ArtifactUtils; import org.apache.maven.project.Graph.Vertex; /** * ProjectSorter */ public class ProjectSorter { private Graph graph; private List<MavenProject> sortedProjects; private Map<String, MavenProject> projectMap; /** * Sort a list of projects. * <ul>
Java - Registered: Sun May 05 03:35:11 GMT 2024 - Last Modified: Fri Sep 22 06:02:04 GMT 2023 - 10.3K bytes - Viewed (0) -
maven-core/src/test/java/org/apache/maven/project/GraphTest.java
Graph graph = new Graph(); graph.addVertex("a"); assertEquals(1, graph.getVertices().size()); assertEquals("a", graph.getVertex("a").getLabel()); graph.addVertex("a"); assertEquals(1, graph.getVertices().size()); assertEquals("a", graph.getVertex("a").getLabel()); graph.addVertex("b");
Java - Registered: Sun Apr 28 03:35:10 GMT 2024 - Last Modified: Fri Sep 22 06:02:04 GMT 2023 - 8.3K bytes - Viewed (0) -
maven-compat/src/test/java/org/apache/maven/repository/metadata/DefaultGraphConflictResolverTest.java
* v1< * v3-v4 * */ graph = new MetadataGraph(4, 3); v1 = graph.addVertex(new ArtifactMetadata("g", "a1", "1.0")); graph.setEntry(v1); v2 = graph.addVertex(new ArtifactMetadata("g", "a2", "1.0")); v3 = graph.addVertex(new ArtifactMetadata("g", "a3", "1.0")); v4 = graph.addVertex(new ArtifactMetadata("g", "a4", "1.0")); // v1-->v2
Java - Registered: Sun May 05 03:35:11 GMT 2024 - Last Modified: Thu Apr 25 05:46:50 GMT 2024 - 8.1K bytes - Viewed (0) -
maven-compat/src/main/java/org/apache/maven/repository/metadata/GraphConflictResolver.java
* in <code>ArtifactScopeEnum</code> * * @param graph the "dirty" graph to be simplified via conflict resolution * @param scope scope for which the graph should be resolved * * @return resulting "clean" graph for the specified scope * * @since 3.0 */ MetadataGraph resolveConflicts(MetadataGraph graph, ArtifactScopeEnum scope) throws GraphConflictResolutionException;
Java - Registered: Sun May 05 03:35:11 GMT 2024 - Last Modified: Wed Sep 06 11:28:54 GMT 2023 - 1.7K bytes - Viewed (0) -
maven-compat/src/main/java/org/apache/maven/repository/metadata/MetadataGraph.java
/** * null in dirty graph, actual * scope for conflict-resolved graph */ ArtifactScopeEnum scope; // ------------------------------------------------------------------------ /** * init graph */ public MetadataGraph(int nVertices) { init(nVertices, 2 * nVertices); } public MetadataGraph(int nVertices, int nEdges) {
Java - Registered: Sun May 05 03:35:11 GMT 2024 - Last Modified: Thu Oct 05 18:41:13 GMT 2023 - 13.1K bytes - Viewed (0) -
maven-core/src/main/java/org/apache/maven/graph/DefaultProjectDependencyGraph.java
private final Map<MavenProject, Integer> order; private final Map<String, MavenProject> projects; /** * Creates a new project dependency graph based on the specified projects. * * @param projects The projects to create the dependency graph with * @throws DuplicateProjectException * @throws CycleDetectedException */ public DefaultProjectDependencyGraph(Collection<MavenProject> projects)
Java - Registered: Sun May 05 03:35:11 GMT 2024 - Last Modified: Fri Sep 22 06:02:04 GMT 2023 - 5.8K bytes - Viewed (0)