aboutsummaryrefslogtreecommitdiff
path: root/stage1/resolver.scala
diff options
context:
space:
mode:
authorChristopher Vogt <oss.nsp@cvogt.org>2016-04-26 18:55:44 -0400
committerChristopher Vogt <oss.nsp@cvogt.org>2016-04-28 13:33:20 -0400
commit13c0f445f48fbea1398ca6340ea4cdd8dcb6bfb0 (patch)
tree5cbf4d4dfff01587e53bc4b18f6193a9dde66501 /stage1/resolver.scala
parent51a353881de307aec8aa7c7f8eb8a83856132633 (diff)
downloadcbt-13c0f445f48fbea1398ca6340ea4cdd8dcb6bfb0.tar.gz
cbt-13c0f445f48fbea1398ca6340ea4cdd8dcb6bfb0.tar.bz2
cbt-13c0f445f48fbea1398ca6340ea4cdd8dcb6bfb0.zip
add important comment
Diffstat (limited to 'stage1/resolver.scala')
-rw-r--r--stage1/resolver.scala6
1 files changed, 4 insertions, 2 deletions
diff --git a/stage1/resolver.scala b/stage1/resolver.scala
index 694bd83..b19255a 100644
--- a/stage1/resolver.scala
+++ b/stage1/resolver.scala
@@ -149,9 +149,11 @@ abstract class Dependency{
new Tree(this, (dependencies diff parents).map(_.resolveRecursive(this :: parents)))
}
- def linearize(deps: Seq[Dependency]): Seq[Dependency] =
+ private def linearize(deps: Seq[Dependency]): Seq[Dependency] =
+ // Order is important here in order to generate the correct lineraized dependency order for EarlyDependencies
+ // (and maybe this as well in case we want to get rid of MultiClassLoader)
if(deps.isEmpty) deps else ( deps ++ linearize(deps.flatMap(_.dependencies)) )
-
+
private object transitiveDependenciesCache extends Cache[Seq[Dependency]]
/** return dependencies in order of linearized dependence. this is a bit tricky. */
def transitiveDependencies: Seq[Dependency] = transitiveDependenciesCache{