Initial implementation of new optimize imports algorithm

This commit is contained in:
Valentin Kipyatkov
2015-02-13 20:33:30 +03:00
parent 63182a53c6
commit 03f7c265d7
16 changed files with 196 additions and 111 deletions
@@ -1,6 +1,7 @@
package test
import dependency.*
import dependency.A
import dependency.T
fun f(a: A, t: T) {
a.f()
@@ -0,0 +1,8 @@
package ppp
import ppp.ppp1
open class C
class D : C()
class E : ppp1.C1()
@@ -0,0 +1,3 @@
package ppp.ppp1
class C1
@@ -0,0 +1,9 @@
package ppp
import ppp.*
import ppp.ppp1
open class C
class D : C()
class E : ppp1.C1()
@@ -1,4 +1,4 @@
import MyClass.*
import MyClass.TEST
fun main() {
TEST
@@ -0,0 +1,18 @@
import Outer.C.Inner2
class Outer {
class Nested
class C {
fun foo(p1: Nested, p2: ClassObjectNested, p3: Nested2) { }
inner class Inner
inner class Inner2
}
class object {
class ClassObjectNested
}
fun f(i: Inner2){}
}
@@ -0,0 +1,21 @@
import Outer.Nested
import Outer.ClassObjectNested
import Outer.C.Inner
import Outer.C.Inner2
class Outer {
class Nested
class C {
fun foo(p1: Nested, p2: ClassObjectNested, p3: Nested2) { }
inner class Inner
inner class Inner2
}
class object {
class ClassObjectNested
}
fun f(i: Inner2){}
}
@@ -1,4 +1,5 @@
import java.util.*
import java.util.ArrayList
import java.util.HashSet
class Action {
fun test(hash: HashSet<Int>) {
@@ -1,4 +1,5 @@
import java.util.*
import java.util.ArrayList
import java.util.HashSet
class Action {
fun test(hash: HashSet<Int>) {
@@ -1,3 +1,3 @@
import java.util.*
import java.util.Comparator
val c = Comparator {(x: Int, y: Int) -> 1}
@@ -1,5 +1,5 @@
import java.io as JavaIO
import java.util.ArrayList
import java.io as JavaIO
import java.util.ArrayList as SomeThing
class Action {