/*
    * (C) Copyright 2006-2014 Nuxeo SA (http://nuxeo.com/) and contributors.
    *
    * All rights reserved. This program and the accompanying materials
    * are made available under the terms of the GNU Lesser General Public License
    * (LGPL) version 2.1 which accompanies this distribution, and is available at
    * http://www.gnu.org/licenses/lgpl-2.1.html
    *
    * This library is distributed in the hope that it will be useful,
   * but WITHOUT ANY WARRANTY; without even the implied warranty of
   * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
   * Lesser General Public License for more details.
   *
   * Contributors:
   *     bstefanescu, slacoin, jcarsique
   */
  package org.nuxeo.build.ant.artifact;
  
  import java.util.Collection;
  
  import org.apache.tools.ant.BuildException;
  import org.apache.tools.ant.Task;
  import org.eclipse.aether.graph.DependencyNode;
  import org.nuxeo.build.maven.AntBuildMojo;
  import org.nuxeo.build.maven.filter.AndFilter;
  import org.nuxeo.build.maven.filter.CompositeFilter;
  import org.nuxeo.build.maven.graph.Graph;
  import org.nuxeo.build.maven.graph.Node;
  
  /**
   * TODO NXBT-258
   */
  public class ExpandTask extends Task {
  
      public String key;
  
      public int depth = Integer.MAX_VALUE;
  
      public AndFilter filter = new AndFilter();
  
      public void setKey(String key) {
          this.key = key;
      }
  
      public void setDepth(String depth) {
          this.depth = Expand.readExpand(depth);
      }
  
      public void addExcludes(Excludes excludes) {
          filter.addFilter(excludes.getFilter());
      }
  
      public void addIncludes(Includes includes) {
          filter.addFilter(includes.getFilter());
      }
  
      protected boolean acceptNode(DependencyNode node) {
          return true;
      }
  
      @Override
      public void execute() throws BuildException {
          AntBuildMojo mojo = AntBuildMojo.getInstance();
          Graph graph;
          if (key != null) {
              graph = new Graph();
              // TODO NXBT-258 mojo graph can be empty!
              Collection<Node> nodes = mojo.getGraph().find(key);
              addRootNodes(graph, nodes);
          } else {
              graph = mojo.newGraph();
          }
          graph.resolveDependencies(CompositeFilter.compact(filter), depth);
      }
  
      public void addRootNodes(Graph graph,
              Collection<? extends DependencyNode> nodes) {
          for (DependencyNode node : nodes) {
              if ("pom".equals(node.getArtifact().getExtension())) {
                  // Add the POM direct dependencies as root nodes instead
                  // addRootNodes(graph, node.getChildren());
                  for (DependencyNode child : node.getChildren()) {
                      if (acceptNode(node)) {
                          graph.addRootNode(new Node(graph, child));
                      }
                  }
              } else if (acceptNode(node)) {
                  graph.addRootNode(new Node(graph, node));
              }
          }
      }
  }