extract inner class to a real class

starting adding services for project generic metadatas.

git-svn-id: https://svn.apache.org/repos/asf/archiva/trunk@1304879 13f79535-47bb-0310-9956-ffa450edef68
This commit is contained in:
Olivier Lamy 2012-03-24 18:23:15 +00:00
parent 0319d5c176
commit f9f42bdd34
1 changed files with 72 additions and 0 deletions

View File

@ -0,0 +1,72 @@
package org.apache.archiva.rest.services.utils;
/*
* Licensed to the Apache Software Foundation (ASF) under one
* or more contributor license agreements. See the NOTICE file
* distributed with this work for additional information
* regarding copyright ownership. The ASF licenses this file
* to you 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.
*/
import net.sf.beanlib.provider.replicator.BeanReplicator;
import org.apache.archiva.rest.api.model.Artifact;
import org.apache.archiva.rest.api.model.TreeEntry;
import org.apache.maven.shared.dependency.tree.DependencyNode;
import org.apache.maven.shared.dependency.tree.traversal.DependencyNodeVisitor;
import java.util.List;
/**
* @author Olivier Lamy
* @since 1.4-M3
*/
public class TreeDependencyNodeVisitor
implements DependencyNodeVisitor
{
final List<TreeEntry> treeEntries;
private TreeEntry currentEntry;
private DependencyNode firstNode;
public TreeDependencyNodeVisitor( List<TreeEntry> treeEntries )
{
this.treeEntries = treeEntries;
}
public boolean visit( DependencyNode node )
{
TreeEntry entry = new TreeEntry( new BeanReplicator().replicateBean( node.getArtifact(), Artifact.class ) );
entry.setParent( currentEntry );
currentEntry = entry;
if ( firstNode == null )
{
firstNode = node;
treeEntries.add( currentEntry );
}
else
{
currentEntry.getParent().getChilds().add( currentEntry );
}
return true;
}
public boolean endVisit( DependencyNode node )
{
currentEntry = currentEntry.getParent();
return true;
}
}