openide/java/java-tests/testSrc/com/intellij/roots/ModuleGraphTest.java

/*
 * Copyright 2000-2015 JetBrains s.r.o.
 *
 * Licensed under the Apache License, Version 2.0 (the "License");
 * you may not use this file except in compliance with the License.
 * You may obtain a copy of the License at
 *
 * http://www.apache.org/licenses/LICENSE-2.0
 *
 * Unless required by applicable law or agreed to in writing, software
 * distributed under the License is distributed on an "AS IS" BASIS,
 * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
 * See the License for the specific language governing permissions and
 * limitations under the License.
 */
package com.intellij.roots;

import com.intellij.openapi.module.Module;
import com.intellij.openapi.module.ModuleManager;
import com.intellij.openapi.roots.DependencyScope;
import com.intellij.openapi.roots.ModuleRootModificationUtil;
import com.intellij.util.containers.ContainerUtil;
import com.intellij.util.graph.Graph;
import com.intellij.util.graph.GraphAlgorithms;

import java.util.HashSet;
import java.util.List;
import java.util.Set;

/**
 * @author Dmitry Avdeev
 */
public class ModuleGraphTest extends ModuleRootManagerTestCase {

  public void testOuts() {

    Module a = createModule("a");
    Module b = createModule("b");
    addDependency(myModule, a);
    addDependency(a, b);

    Graph<Module> graph = ModuleManager.getInstance(getProject()).moduleGraph();
    List<Module> outs = ContainerUtil.collect(graph.getOut(a));
    assertEquals(1, outs.size());

    Set<Module> set = new HashSet<>();
    GraphAlgorithms.getInstance().collectOutsRecursively(graph, b, set);
    assertEquals(3, set.size());
  }

  protected void addDependency(Module module, Module a) {
    ModuleRootModificationUtil.addDependency(module, a, DependencyScope.COMPILE, true);
  }
}