DependencyGraphTest.java

/**********************************************************************
 * Copyright (c) 2005-2009 ant4eclipse project team.
 *
 * All rights reserved. This program and the accompanying materials
 * are made available under the terms of the Eclipse Public License v1.0
 * which accompanies this distribution, and is available at
 * http://www.eclipse.org/legal/epl-v10.html
 *
 * Contributors:
 *     Nils Hartmann, Daniel Kasmeroglu, Gerd Wuetherich
 **********************************************************************/
package org.ant4eclipse.lib.core.dependencygraph;

import org.ant4eclipse.lib.core.CoreExceptionCode;
import org.ant4eclipse.lib.core.dependencygraph.DependencyGraph;
import org.ant4eclipse.lib.core.dependencygraph.Edge;
import org.ant4eclipse.lib.core.exception.Ant4EclipseException;
import org.junit.Assert;
import org.junit.Test;

import java.util.List;

/**
 * Test: DependencyGraph
 * 
 * @author Gerd Wütherich (gerd@gerd-wuetherich.de)
 */
public class DependencyGraphTest {

  @Test
  public void dependencyGraph() {
    String o1 = "o1";
    String o11 = "o11";
    String o12 = "o12";
    String o121 = "o121";
    String o2 = "o2";

    DependencyGraph<String> graph = new DependencyGraph<String>();

    graph.addVertex(o1);
    graph.addVertex(o11);
    graph.addVertex(o12);
    graph.addVertex(o121);
    graph.addVertex(o2);

    graph.addEdge(o1, o11);
    graph.addEdge(o1, o12);
    graph.addEdge(o12, o121);
    graph.addEdge(o1, o2);

    List<String> result = graph.calculateOrder();

    Assert.assertEquals(5, result.size());

    Assert.assertEquals(o11, result.get(0));
    Assert.assertEquals(o121, result.get(1));
    Assert.assertEquals(o2, result.get(2));
    Assert.assertEquals(o12, result.get(3));
    Assert.assertEquals(o1, result.get(4));

  }

  /**
   *
   */
  @Test
  public void cyclicDependencyGraph() {
    String o1 = "o1";
    String o2 = "o2";
    String o3 = "o3";

    DependencyGraph<String> graph = new DependencyGraph<String>();

    graph.addVertex(o1);
    graph.addVertex(o2);
    graph.addVertex(o3);

    graph.addEdge(o1, o2);
    graph.addEdge(o2, o3);
    graph.addEdge(o3, o1);

    try {
      graph.calculateOrder();
      Assert.fail();
    } catch (Ant4EclipseException ex) {
      Assert.assertEquals(CoreExceptionCode.CYCLIC_DEPENDENCIES_EXCEPTION, ex.getExceptionCode());
    }
  }

  @Test
  public void edge() {
    Object parent = new Object();
    Object child = new Object();

    Edge<Object> edge_1 = new Edge<Object>(parent, child);
    Edge<Object> edge_2 = new Edge<Object>(parent, child);
    Assert.assertEquals(edge_1.hashCode(), edge_2.hashCode());
    Assert.assertEquals(edge_1, edge_2);
    Assert.assertTrue(edge_1.equals(edge_1));
    Assert.assertTrue(edge_2.equals(edge_2));
    Assert.assertFalse(edge_1.equals(null));
    Assert.assertFalse(edge_2.equals(null));

    Edge<Object> edge_3 = new Edge<Object>(parent, new Object());
    Edge<Object> edge_4 = new Edge<Object>(new Object(), child);
    Assert.assertFalse(edge_1.equals(edge_3));
    Assert.assertFalse(edge_1.equals(edge_4));

    Assert.assertFalse(edge_1.equals(new RuntimeException()));
  }

  @Test
  public void forrest() {
    String o1 = "o1";
    String o2 = "o2";
    String o3 = "o3";
    String t1 = "t1";
    String t2 = "t2";

    DependencyGraph<String> graph = new DependencyGraph<String>();

    graph.addVertex(o1);
    graph.addVertex(o2);
    graph.addVertex(o3);
    graph.addVertex(t1);
    graph.addVertex(t2);

    graph.addEdge(o1, o2);
    graph.addEdge(o2, o3);
    graph.addEdge(t1, t2);

    List<String> result = graph.calculateOrder();

    Assert.assertEquals("o3", result.get(0));
    Assert.assertEquals("t2", result.get(1));
    Assert.assertEquals("o2", result.get(2));
    Assert.assertEquals("t1", result.get(3));
    Assert.assertEquals("o1", result.get(4));

  }

} /* ENDCLASS */