kotlin/compiler/testData/javaModules/unnamedReadsTransitive/moduleC/usage.kt at d4f25e104364eaef8a9e95773cfdfd39d7c33ce2 - kotlin - Gitea: Git with a cup of tea

jlengrand/kotlin

mirror of https://github.com/jlengrand/kotlin.git synced 2026-05-08 15:53:19 +00:00

Files

Alexander Udalov 5192f946c5 Fix depth-first search for Java 9 modules

To compute modules to be added to compilation roots in
JavaModuleGraph.getAllDependencies, we should look not only for
transitive requirements of root modules, but for transitive requirements
of _root modules' requirements_. The same logic applies to
JavaModuleGraph.reads. In other words, when looking for a path in the
module graph between two modules, the first edge's transitiveness
doesn't matter, but all other edges after the first must be transitive.

There was also a stupid bug in dfs in
JavaModuleGraph.getAllDependencies: we continued the DFS only if the
module _was not_ added to the "visited" set ("add" returns true if the
element was added successfully)

 #KT-18598 In Progress

2017-06-29 15:59:57 +03:00

9 lines

111 B

Kotlin

Vendored

Raw Blame History

 import foo.*
 import bar.*
 fun test(): String {
     val f = Foo()
     val b = Bar.getFoo()
     return "$f$b"
 }