hudson.plugins.depgraph_view.model.graph.CycleFinderTest.java Source code

Java tutorial

Introduction

Here is the source code for hudson.plugins.depgraph_view.model.graph.CycleFinderTest.java

Source

/*
 * Copyright (c) 2010 Stefan Wolf
 *
 * Permission is hereby granted, free of charge, to any person obtaining a copy
 * of this software and associated documentation files (the "Software"), to deal
 * in the Software without restriction, including without limitation the rights
 * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
 * copies of the Software, and to permit persons to whom the Software is
 * furnished to do so, subject to the following conditions:
 *
 * The above copyright notice and this permission notice shall be included in
 * all copies or substantial portions of the Software.
 *
 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
 * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
 * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
 * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
 * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
 * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
 * THE SOFTWARE.
 */

package hudson.plugins.depgraph_view.model.graph;

import com.google.common.collect.ImmutableSet;
import com.google.common.collect.Lists;
import hudson.model.AbstractProject;
import hudson.model.FreeStyleProject;
import hudson.plugins.depgraph_view.model.operations.CycleFinder;
import hudson.tasks.BuildTrigger;
import org.apache.commons.collections.CollectionUtils;
import org.junit.Rule;
import org.junit.Test;
import org.jvnet.hudson.test.JenkinsRule;

import java.io.IOException;
import java.util.Arrays;
import java.util.Collection;
import java.util.Collections;

import static hudson.plugins.depgraph_view.model.graph.ProjectNode.node;
import static org.junit.Assert.*;

public class CycleFinderTest {
    private FreeStyleProject project1;
    private FreeStyleProject project2;
    private FreeStyleProject project3;

    @Rule
    public JenkinsRule j = new JenkinsRule();

    @Test
    public void testNoCycleExists() throws IOException {
        createProjects();
        addDependency(project1, project2);
        j.jenkins.rebuildDependencyGraph();
        DependencyGraph graph = generateGraph(project1);
        assertGraphContainsProjects(graph, project1, project2);
        assertFalse(CycleFinder.hasCycle(graph));
    }

    @Test
    public void test1CycleExists() throws IOException {
        createProjects();
        addDependency(project1, project2);
        addDependency(project2, project3);
        addDependency(project3, project1);
        j.getInstance().rebuildDependencyGraph();
        DependencyGraph graph = generateGraph(project2);
        assertGraphContainsProjects(graph, project1, project2, project3);
        assertTrue(CycleFinder.hasCycle(graph));
    }

    @Test
    public void testNoCycleNodes() throws IOException {
        createProjects();
        addDependency(project1, project2);
        addDependency(project2, project3);
        j.getInstance().rebuildDependencyGraph();
        DependencyGraph graph = generateGraph(project2);
        assertGraphContainsProjects(graph, project1, project2, project3);
        assertTrue(CycleFinder.getCycleNodes(graph).size() == 0);
    }

    @Test
    public void test1CycleNodes() throws IOException {
        createProjects();
        addDependency(project1, project2);
        addDependency(project2, project3);
        addDependency(project3, project1);
        j.getInstance().rebuildDependencyGraph();
        DependencyGraph graph = generateGraph(project2);
        assertGraphContainsProjects(graph, project1, project2, project3);
        assertTrue(CollectionUtils.isEqualCollection(CycleFinder.getCycleNodes(graph), graph.getNodes()));
    }

    @Test
    public void testNoCycleEdges() throws IOException {
        createProjects();
        addDependency(project1, project2);
        addDependency(project2, project3);
        j.getInstance().rebuildDependencyGraph();
        DependencyGraph graph = generateGraph(project2);
        assertGraphContainsProjects(graph, project1, project2, project3);
        assertTrue(CycleFinder.getCycleEdges(graph).size() == 0);
    }

    @Test
    public void test1CycleEdges() throws IOException {
        createProjects();
        addDependency(project1, project2);
        addDependency(project2, project3);
        addDependency(project3, project1);
        j.getInstance().rebuildDependencyGraph();
        DependencyGraph graph = generateGraph(project2);
        assertGraphContainsProjects(graph, project1, project2, project3);
        System.out.println(CycleFinder.getCycleEdges(graph));
        System.out.println(graph.getEdges());
        assertTrue(CollectionUtils.isEqualCollection(CycleFinder.getCycleEdges(graph), graph.getEdges()));
    }

    private void assertGraphContainsProjects(DependencyGraph graph, AbstractProject<?, ?>... projects) {
        Collection<ProjectNode> projectNodes = Lists
                .newArrayList(GraphCalculator.abstractProjectSetToProjectNodeSet(Arrays.asList(projects)));
        assertTrue(graph.getNodes().containsAll(projectNodes));
    }

    private DependencyGraph generateGraph(AbstractProject<?, ?> from) {
        return new GraphCalculator(getDependencyGraphEdgeProviders())
                .generateGraph(Collections.singleton(node(from)));
    }

    private void createProjects() throws IOException {
        project1 = j.createFreeStyleProject();
        project2 = j.createFreeStyleProject();
        project3 = j.createFreeStyleProject();
    }

    private ImmutableSet<EdgeProvider> getDependencyGraphEdgeProviders() {
        return ImmutableSet.<EdgeProvider>of(new DependencyGraphEdgeProvider(j.getInstance()));
    }

    private void addDependency(AbstractProject<?, ?> project1, AbstractProject<?, ?> project2) throws IOException {
        project1.getPublishersList().add(new BuildTrigger(project2.getName(), false));
    }
}