azalea/kotlin-fork
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

DescriptorSearchRule should help detecting loops

Browse Source
This commit is contained in:
Stepan Koltsov
2012-03-20 19:32:46 +04:00
parent 03667a1be9
commit 54af5d9f9f
14 changed files with 118 additions and 53 deletions
Download Patch File Download Diff File Expand all files Collapse all files
jdk-headers/src/java/util/AbstractMap.kt
+3 -1
View File
@@ -1,5 +1,7 @@
package java.util
import java.util.Map.Entry
abstract public open class AbstractMap<erased K, erased V> protected () : java.lang.Object(), java.util.Map<K, V> {
override public fun size() : Int {}
override public fun isEmpty() : Boolean {}
@@ -12,7 +14,7 @@ abstract public open class AbstractMap<erased K, erased V> protected () : java.l
override public fun clear() : Unit {}
override public fun keySet() : java.util.Set<K> {}
override public fun values() : java.util.Collection<V> {}
abstract override public fun entrySet() : java.util.Set<java.util.Map.Entry<K, V>>
abstract override public fun entrySet() : java.util.Set<Entry<K, V>>
//override public fun equals(o : Any?) : Boolean
//override public fun hashCode() : Int
//override public fun toString() : java.lang.String?
jdk-headers/src/java/util/HashMap.kt
+3 -2
View File
@@ -1,5 +1,6 @@
package java.util
import java.io.*
import java.util.Map.Entry
public open class HashMap<erased K, erased V>(m : java.util.Map<out K, out V>) : java.util.AbstractMap<K, V>(),
java.util.Map<K, V>,
java.lang.Cloneable,
@@ -19,5 +20,5 @@ public open class HashMap<erased K, erased V>(m : java.util.Map<out K, out V>) :
override public fun clone() : Any? {}
override public fun keySet() : java.util.Set<K> {}
override public fun values() : java.util.Collection<V> {}
override public fun entrySet() : java.util.Set<java.util.Map.Entry<K, V>> {}
}
override public fun entrySet() : java.util.Set<Entry<K, V>> {}
}
jdk-headers/src/java/util/LinkedHashMap.kt
+4 -2
View File
@@ -1,5 +1,7 @@
package java.util
import java.util.Map.Entry
public open class LinkedHashMap<erased K, erased V>(m : java.util.Map<out K, out V>) : java.util.HashMap<K, V>(), java.util.Map<K, V> {
public this(initialCapacity : Int, loadFactor : Float) {}
public this(initialCapacity : Int) {}
@@ -8,7 +10,7 @@ public open class LinkedHashMap<erased K, erased V>(m : java.util.Map<out K, out
override public fun containsValue(value : Any?) : Boolean {}
override public fun get(key : Any?) : V? {}
override public fun clear() : Unit {}
open protected fun removeEldestEntry(eldest : java.util.Map.Entry<K, V>) : Boolean {}
open protected fun removeEldestEntry(eldest : Entry<K, V>) : Boolean {}
//class object {
//open public fun init<K, V>(initialCapacity : Int, loadFactor : Float) : LinkedHashMap<K, V> {
//val __ = LinkedHashMap(0, null, false)
@@ -31,4 +33,4 @@ public open class LinkedHashMap<erased K, erased V>(m : java.util.Map<out K, out
//return __
//}
//}
}
}