Nikolay Lunyak
a68a2409d3
In case we don't want to introduce any new abstractions like "user relevance for applicability", we can just remove the filtering. ^KT-62541 Fixed
13 lines
448 B
Kotlin
Vendored
13 lines
448 B
Kotlin
Vendored
//KT-742 Stack overflow in type inference
|
|
package a
|
|
|
|
fun <T : Any> T?.sure() : T = this!!
|
|
|
|
class List<T>(val head: T, val tail: List<T>? = null)
|
|
|
|
fun <T, Q> List<T>.map1(f: (T)-> Q): List<T>? = tail!!.map1(f)
|
|
|
|
fun <T, Q> List<T>.map2(f: (T)-> Q): List<T>? = tail.sure().map2(f)
|
|
|
|
fun <T, Q> List<T>.map3(f: (T)-> Q): List<T>? = tail.<!INAPPLICABLE_CANDIDATE!>sure<!><<!UPPER_BOUND_VIOLATED!>T<!>>().<!UNRESOLVED_REFERENCE_WRONG_RECEIVER!>map3<!>(f)
|