@@ -18,6 +18,7 @@ package net.virtualvoid.sbt.graph
1818
1919import java .io .File
2020
21+ import net .virtualvoid .sbt .graph .ModuleGraph .DepMap
2122import sbinary .Format
2223
2324import scala .collection .mutable .{ HashMap , MultiMap , Set }
@@ -40,6 +41,8 @@ case class Module(id: ModuleId,
4041
4142object ModuleGraph {
4243 val empty = ModuleGraph (Seq .empty, Seq .empty)
44+
45+ type DepMap = Map [ModuleId , Seq [Module ]]
4346}
4447
4548case class ModuleGraph (nodes : Seq [Module ], edges : Seq [Edge ]) {
@@ -48,13 +51,13 @@ case class ModuleGraph(nodes: Seq[Module], edges: Seq[Edge]) {
4851
4952 def module (id : ModuleId ): Module = modules(id)
5053
51- lazy val dependencyMap : Map [ ModuleId , Seq [ Module ]] =
54+ lazy val dependencyMap : DepMap =
5255 createMap(identity)
5356
54- lazy val reverseDependencyMap : Map [ ModuleId , Seq [ Module ]] =
57+ lazy val reverseDependencyMap : DepMap =
5558 createMap { case (a, b) ⇒ (b, a) }
5659
57- def createMap (bindingFor : ((ModuleId , ModuleId )) ⇒ (ModuleId , ModuleId )): Map [ ModuleId , Seq [ Module ]] = {
60+ def createMap (bindingFor : ((ModuleId , ModuleId )) ⇒ (ModuleId , ModuleId )): DepMap = {
5861 val m = new HashMap [ModuleId , Set [Module ]] with MultiMap [ModuleId , Module ]
5962 edges.foreach { entry ⇒
6063 val (f, t) = bindingFor(entry)
0 commit comments