Examples with ValueStreamMap com.thoughtworks.go.domain.valuestreammap.ValueStreamMap used on opensource projects

Example 21 with ValueStreamMap

use of com.thoughtworks.go.domain.valuestreammap.ValueStreamMap in project gocd by gocd.

the class CrossingMinimizationTest method shouldAssignNodesBasedOnMinimumDepthForUpstreamGraph.

@Test
public void shouldAssignNodesBasedOnMinimumDepthForUpstreamGraph() {
    /*
            g1 --> P1 --> P
               \        / ^
                \     /   |
            g2   +->P2    |
               \          |
                \         |
            g3 --> P3-----+
         */
    String p = "P";
    String p1 = "P1";
    String p2 = "P2";
    String p3 = "P3";
    String g1 = "g1";
    String g2 = "g2";
    String g3 = "g3";
    ValueStreamMap graph = new ValueStreamMap(p, null);
    graph.addUpstreamNode(new PipelineDependencyNode(p1, p1), null, p);
    graph.addUpstreamMaterialNode(new SCMDependencyNode(g1, g1, "git"), null, p1, new MaterialRevision(null));
    graph.addUpstreamNode(new PipelineDependencyNode(p2, p2), null, p);
    graph.addUpstreamMaterialNode(new SCMDependencyNode(g1, g1, "git"), null, p2, new MaterialRevision(null));
    graph.addUpstreamNode(new PipelineDependencyNode(p3, p3), null, p);
    graph.addUpstreamMaterialNode(new SCMDependencyNode(g2, g2, "git"), null, p3, new MaterialRevision(null));
    graph.addUpstreamMaterialNode(new SCMDependencyNode(g3, g3, "git"), null, p3, new MaterialRevision(null));
    NodeLevelMap levelToNodesMap = nodeLevelMap(graph);
    crossingMinimization.apply(levelToNodesMap);
    assertThat(levelToNodesMap.get(0), is(Arrays.asList(graph.findNode(p))));
    assertThat(levelToNodesMap.get(-1), is(Arrays.asList(graph.findNode(p1), graph.findNode(p2), graph.findNode(p3))));
    assertThat(levelToNodesMap.get(-2), is(Arrays.asList(graph.findNode(g1), graph.findNode(g2), graph.findNode(g3))));
    assertThat(graph.findNode(g1).getDepth(), is(1));
    assertThat(graph.findNode(g2).getDepth(), is(2));
    assertThat(graph.findNode(g3).getDepth(), is(3));
    assertThat(graph.findNode(p1).getDepth(), is(1));
    assertThat(graph.findNode(p2).getDepth(), is(2));
    assertThat(graph.findNode(p3).getDepth(), is(3));
    assertThat(graph.findNode(p).getDepth(), is(1));
}

Example 22 with ValueStreamMap

use of com.thoughtworks.go.domain.valuestreammap.ValueStreamMap in project gocd by gocd.

the class CrossingMinimizationTest method shouldReorderNodesBasedOnBaryCenterValueForUpstreamGraph.

@Test
public void shouldReorderNodesBasedOnBaryCenterValueForUpstreamGraph() {
    /*
            g1 --> P1--->P3
               \/      /
               /\    /
            g2    P2
         */
    String p3 = "P3";
    String p1 = "P1";
    String p2 = "P2";
    String g1 = "g1";
    String g2 = "g2";
    ValueStreamMap graph = new ValueStreamMap(p3, null);
    graph.addUpstreamNode(new PipelineDependencyNode(p1, p1), null, p3);
    graph.addUpstreamMaterialNode(new SCMDependencyNode(g1, g1, "git"), null, p1, new MaterialRevision(null));
    graph.addUpstreamMaterialNode(new SCMDependencyNode(g2, g2, "git"), null, p1, new MaterialRevision(null));
    graph.addUpstreamNode(new PipelineDependencyNode(p2, p2), null, p3);
    graph.addUpstreamMaterialNode(new SCMDependencyNode(g1, g1, "git"), null, p2, new MaterialRevision(null));
    NodeLevelMap levelToNodesMap = nodeLevelMap(graph);
    assertThat(levelToNodesMap.get(-1), is(Arrays.asList(graph.findNode(p1), graph.findNode(p2))));
    crossingMinimization.apply(levelToNodesMap);
    assertThat(levelToNodesMap.get(0), is(Arrays.asList(graph.findNode(p3))));
    assertThat(levelToNodesMap.get(-1), is(Arrays.asList(graph.findNode(p2), graph.findNode(p1))));
    assertThat(levelToNodesMap.get(-2), is(Arrays.asList(graph.findNode(g1), graph.findNode(g2))));
    assertThat(graph.findNode(g1).getDepth(), is(1));
    assertThat(graph.findNode(g2).getDepth(), is(2));
    assertThat(graph.findNode(p1).getDepth(), is(2));
    assertThat(graph.findNode(p2).getDepth(), is(1));
    assertThat(graph.findNode(p3).getDepth(), is(1));
}