org.apache.maven.graph.effective.traverse.BuildOrderTraversal Maven / Gradle / Ivy
The newest version!
/*******************************************************************************
* Copyright 2012 John Casey
*
* 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.effective.traverse;
import java.util.ArrayList;
import java.util.HashSet;
import java.util.Iterator;
import java.util.List;
import java.util.Set;
import org.apache.maven.graph.common.ref.ArtifactRef;
import org.apache.maven.graph.common.ref.ProjectRef;
import org.apache.maven.graph.common.ref.ProjectVersionRef;
import org.apache.maven.graph.effective.EProjectCycle;
import org.apache.maven.graph.effective.EProjectNet;
import org.apache.maven.graph.effective.filter.OrFilter;
import org.apache.maven.graph.effective.filter.ParentFilter;
import org.apache.maven.graph.effective.filter.ProjectRelationshipFilter;
import org.apache.maven.graph.effective.rel.ProjectRelationship;
import org.apache.maven.graph.effective.traverse.model.BuildOrder;
public class BuildOrderTraversal
extends AbstractFilteringTraversal
{
private final List order = new ArrayList();
private Set cycles;
public BuildOrderTraversal()
{
}
public BuildOrderTraversal( final ProjectRelationshipFilter filter )
{
super( new OrFilter( filter, new ParentFilter( false ) ) );
}
public BuildOrder getBuildOrder()
{
return new BuildOrder( order, cycles );
}
@Override
protected boolean shouldTraverseEdge( final ProjectRelationship> relationship,
final List> path, final int pass )
{
final ProjectVersionRef decl = relationship.getDeclaring();
ProjectVersionRef target = relationship.getTarget();
if ( target instanceof ArtifactRef )
{
target = ( (ArtifactRef) target ).asProjectVersionRef();
}
final ProjectRef baseDecl = new ProjectRef( decl.getGroupId(), decl.getArtifactId() );
final ProjectRef baseTgt = new ProjectRef( target.getGroupId(), target.getArtifactId() );
int declIdx = order.indexOf( baseDecl );
final int tgtIdx = order.indexOf( baseTgt );
if ( declIdx < 0 )
{
declIdx = order.size();
order.add( baseDecl );
}
if ( tgtIdx < 0 )
{
order.add( declIdx, baseTgt );
}
return true;
}
@Override
public void endTraverse( final int pass, final EProjectNet network )
{
super.endTraverse( pass, network );
final Set cycles = new HashSet( network.getCycles() );
for ( final Iterator iterator = cycles.iterator(); iterator.hasNext(); )
{
final EProjectCycle eProjectCycle = iterator.next();
ProjectRelationshipFilter filter = getFilter();
boolean include = true;
for ( final ProjectRelationship> rel : eProjectCycle )
{
if ( !filter.accept( rel ) )
{
include = false;
break;
}
filter = filter.getChildFilter( rel );
}
if ( !include )
{
iterator.remove();
}
}
this.cycles = cycles;
}
}
© 2015 - 2025 Weber Informatics LLC | Privacy Policy