com.timboudreau.maven.dependency.graph.fork.GraphConstructor.java Source code

Java tutorial

Introduction

Here is the source code for com.timboudreau.maven.dependency.graph.fork.GraphConstructor.java

Source

/*
 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS HEADER.
 *
 * Copyright 2010 Oracle and/or its affiliates. All rights reserved.
 *
 * Oracle and Java are registered trademarks of Oracle and/or its affiliates.
 * Other names may be trademarks of their respective owners.
 *
 * The contents of this file are subject to the terms of either the GNU
 * General Public License Version 2 only ("GPL") or the Common
 * Development and Distribution License("CDDL") (collectively, the
 * "License"). You may not use this file except in compliance with the
 * License. You can obtain a copy of the License at
 * http://www.netbeans.org/cddl-gplv2.html
 * or nbbuild/licenses/CDDL-GPL-2-CP. See the License for the
 * specific language governing permissions and limitations under the
 * License.  When distributing the software, include this License Header
 * Notice in each file and include the License file at
 * nbbuild/licenses/CDDL-GPL-2-CP.  Oracle designates this
 * particular file as subject to the "Classpath" exception as provided
 * by Oracle in the GPL Version 2 section of the License file that
 * accompanied this code. If applicable, add the following below the
 * License Header, with the fields enclosed by brackets [] replaced by
 * your own identifying information:
 * "Portions Copyrighted [year] [name of copyright owner]"
 *
 * If you wish your version of this file to be governed by only the CDDL
 * or only the GPL Version 2, indicate your decision by adding
 * "[Contributor] elects to include this software in this distribution
 * under the [CDDL or GPL Version 2] license." If you do not indicate a
 * single choice of license, a recipient has the option to distribute
 * your version of this file under either the CDDL, the GPL Version 2 or
 * to extend the choice of license to its licensees as provided above.
 * However, if you add GPL Version 2 code and therefore, elected the GPL
 * Version 2 license, then the option applies only if the new code is
 * made subject to such option by the copyright holder.
 *
 * Contributor(s):
 *
 * Portions Copyrighted 2009 Sun Microsystems, Inc.
 */

package com.timboudreau.maven.dependency.graph.fork;

import com.timboudreau.vl.jung.JungScene.GraphMutator;
import java.util.ArrayList;
import java.util.HashMap;
import java.util.List;
import java.util.Map;
import java.util.Stack;
import org.apache.maven.artifact.Artifact;
import org.apache.maven.model.Dependency;
import org.apache.maven.model.DependencyManagement;
import org.apache.maven.project.MavenProject;
import org.apache.maven.shared.dependency.tree.DependencyNode;
import org.apache.maven.shared.dependency.tree.traversal.DependencyNodeVisitor;

/**
 *
 * @author mkleint
 */
class GraphConstructor implements DependencyNodeVisitor {
    private DependencyGraphScene scene;
    private DependencyNode root;
    private Stack<DependencyNode> path;
    //    private Stack<ArtifactGraphNode> graphPath;
    private Map<String, ArtifactGraphNode> cache;
    private List<ArtifactGraphEdge> edges;

    GraphConstructor(DependencyGraphScene scene) {
        this.scene = scene;
        path = new Stack<DependencyNode>();
        //        graphPath = new Stack<ArtifactGraphNode>();
        cache = new HashMap<String, ArtifactGraphNode>();
        edges = new ArrayList<ArtifactGraphEdge>();
    }

    @Override
    public boolean visit(DependencyNode node) {
        if (root == null) {
            root = node;
        }
        ArtifactGraphNode grNode;
        boolean primary = false;
        grNode = cache.get(node.getArtifact().getDependencyConflictId());
        if (node.getState() == DependencyNode.INCLUDED) {
            if (grNode == null) {
                grNode = new ArtifactGraphNode(node);
                cache.put(node.getArtifact().getDependencyConflictId(), grNode);
            } else {
                grNode.setArtifact(node);
            }
            grNode.setPrimaryLevel(path.size());
            primary = true;
        } else {
            if (grNode == null) {
                grNode = new ArtifactGraphNode(node);
                Artifact a = node.getState() == DependencyNode.OMITTED_FOR_CONFLICT ? node.getRelatedArtifact()
                        : node.getArtifact();
                cache.put(a.getDependencyConflictId(), grNode);
            }
            grNode.addDuplicateOrConflict(node);
        }

        if (!path.empty()) {
            DependencyNode parent = path.peek();
            ArtifactGraphEdge ed = new ArtifactGraphEdge(parent, node);
            ed.setLevel(path.size() - 1);
            ed.setPrimaryPath(primary);
            edges.add(ed);
        }

        if (node != root && grNode.getArtifact() != null) {
            grNode.setManagedState(obtainManagedState(grNode.getArtifact().getArtifact(), scene));
        }

        path.push(node);
        //        graphPath.push(grNode);

        return true;
    }

    @Override
    public boolean endVisit(DependencyNode node) {
        path.pop();
        //        graphPath.pop();
        if (root == node) {
            try (GraphMutator<ArtifactGraphNode, ArtifactGraphEdge> mutator = scene.modifyGraph()) {
                //add all nodes and edges now
                ArtifactGraphNode rootNode = cache.get(node.getArtifact().getDependencyConflictId());
                //root needs to go first..
                mutator.addGraphNode(rootNode);
                for (ArtifactGraphNode nd : cache.values()) {
                    if (nd != rootNode) {
                        mutator.addGraphNode(nd);
                    }
                }
                for (ArtifactGraphEdge ed : edges) {
                    ArtifactGraphNode grNode = cache.get(ed.getTarget().getArtifact().getDependencyConflictId());
                    if (grNode == null) { //FOR conflicting nodes..
                        grNode = cache.get(ed.getTarget().getRelatedArtifact().getDependencyConflictId());
                    }
                    ArtifactGraphNode parentGrNode = cache
                            .get(ed.getSource().getArtifact().getDependencyConflictId());
                    mutator.addGraphEdge(ed, parentGrNode, grNode);
                }
            }
        }
        return true;
    }

    private static int obtainManagedState(Artifact artifact, DependencyGraphScene scene) {
        MavenProject proj = scene.getMavenProject();
        if (proj == null) {
            return ArtifactGraphNode.UNMANAGED;
        }

        DependencyManagement dm = proj.getDependencyManagement();
        if (dm == null) {
            return ArtifactGraphNode.UNMANAGED;
        }

        @SuppressWarnings("unchecked")
        List<Dependency> deps = dm.getDependencies();
        if (deps == null) {
            return ArtifactGraphNode.UNMANAGED;
        }

        String id = artifact.getArtifactId();
        String groupId = artifact.getGroupId();
        String version = artifact.getVersion();

        for (Dependency dep : deps) {
            if (id.equals(dep.getArtifactId()) && groupId.equals(dep.getGroupId())) {
                if (!version.equals(dep.getVersion())) {
                    return ArtifactGraphNode.OVERRIDES_MANAGED;
                } else {
                    return ArtifactGraphNode.MANAGED;
                }
            }
        }

        return ArtifactGraphNode.UNMANAGED;
    }
}