This commit is contained in:
Guillaume Nodet
2021-09-07 16:23:49 +02:00
parent f36f531b00
commit f59cd2a0d1

View File

@@ -1,3 +1,18 @@
/*
* Copyright 2019 the original author or authors.
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
package org.apache.maven.graph;
/*
@@ -18,7 +33,6 @@ package org.apache.maven.graph;
* specific language governing permissions and limitations
* under the License.
*/
import java.util.ArrayList;
import java.util.Collection;
import java.util.Collections;
@@ -26,7 +40,6 @@ import java.util.HashSet;
import java.util.List;
import java.util.Objects;
import java.util.Set;
import org.apache.maven.execution.ProjectDependencyGraph;
import org.apache.maven.project.DuplicateProjectException;
import org.apache.maven.project.MavenProject;
@@ -39,8 +52,7 @@ import org.codehaus.plexus.util.dag.CycleDetectedException;
* @author Benjamin Bentmann
*/
public class DefaultProjectDependencyGraph
implements ProjectDependencyGraph
{
implements ProjectDependencyGraph {
private ProjectSorter sorter;
@@ -54,8 +66,7 @@ public class DefaultProjectDependencyGraph
* @throws CycleDetectedException
*/
public DefaultProjectDependencyGraph(Collection<MavenProject> projects)
throws CycleDetectedException, DuplicateProjectException
{
throws CycleDetectedException, DuplicateProjectException {
super();
this.allProjects = Collections.unmodifiableList(new ArrayList<>(projects));
this.sorter = new ProjectSorter(projects);
@@ -73,8 +84,7 @@ public class DefaultProjectDependencyGraph
*/
public DefaultProjectDependencyGraph(final List<MavenProject> allProjects,
final Collection<MavenProject> projects)
throws CycleDetectedException, DuplicateProjectException
{
throws CycleDetectedException, DuplicateProjectException {
super();
this.allProjects = Collections.unmodifiableList(new ArrayList<>(allProjects));
this.sorter = new ProjectSorter(projects);
@@ -83,18 +93,15 @@ public class DefaultProjectDependencyGraph
/**
* @since 3.5.0
*/
public List<MavenProject> getAllProjects()
{
public List<MavenProject> getAllProjects() {
return this.allProjects;
}
public List<MavenProject> getSortedProjects()
{
public List<MavenProject> getSortedProjects() {
return new ArrayList<>(sorter.getSortedProjects());
}
public List<MavenProject> getDownstreamProjects( MavenProject project, boolean transitive )
{
public List<MavenProject> getDownstreamProjects(MavenProject project, boolean transitive) {
Objects.requireNonNull(project, "project cannot be null");
Set<String> projectIds = new HashSet<>();
@@ -104,19 +111,15 @@ public class DefaultProjectDependencyGraph
return getSortedProjects(projectIds);
}
private void getDownstreamProjects( String projectId, Set<String> projectIds, boolean transitive )
{
for ( String id : sorter.getDependents( projectId ) )
{
if ( projectIds.add( id ) && transitive )
{
private void getDownstreamProjects(String projectId, Set<String> projectIds, boolean transitive) {
for (String id : sorter.getDependents(projectId)) {
if (projectIds.add(id) && transitive) {
getDownstreamProjects(id, projectIds, transitive);
}
}
}
public List<MavenProject> getUpstreamProjects( MavenProject project, boolean transitive )
{
public List<MavenProject> getUpstreamProjects(MavenProject project, boolean transitive) {
Objects.requireNonNull(project, "project cannot be null");
Set<String> projectIds = new HashSet<>();
@@ -126,25 +129,19 @@ public class DefaultProjectDependencyGraph
return getSortedProjects(projectIds);
}
private void getUpstreamProjects( String projectId, Collection<String> projectIds, boolean transitive )
{
for ( String id : sorter.getDependencies( projectId ) )
{
if ( projectIds.add( id ) && transitive )
{
private void getUpstreamProjects(String projectId, Collection<String> projectIds, boolean transitive) {
for (String id : sorter.getDependencies(projectId)) {
if (projectIds.add(id) && transitive) {
getUpstreamProjects(id, projectIds, transitive);
}
}
}
private List<MavenProject> getSortedProjects( Set<String> projectIds )
{
private List<MavenProject> getSortedProjects(Set<String> projectIds) {
List<MavenProject> result = new ArrayList<>(projectIds.size());
for ( MavenProject mavenProject : sorter.getSortedProjects() )
{
if ( projectIds.contains( ProjectSorter.getId( mavenProject ) ) )
{
for (MavenProject mavenProject : sorter.getSortedProjects()) {
if (projectIds.contains(ProjectSorter.getId(mavenProject))) {
result.add(mavenProject);
}
}
@@ -153,8 +150,7 @@ public class DefaultProjectDependencyGraph
}
@Override
public String toString()
{
public String toString() {
return sorter.getSortedProjects().toString();
}