Rad*_*scu 9 generics scala type-inference
我编写了以下代码,这实际上是scala中的一个愚蠢的合并排序实现:
import scala.collection.immutable.List
object MergeSort {
def sort[T,E]( comparator: (E,E) => Int ) (l: List[T]): List[T] = {
def merge[T](first: List[T], second: List[T]): List[T] = (first, second) match {
case (_, List()) => first
case (List(), _) => second
case (f::restFirst, s::restSecond) if comparator(f.asInstanceOf[E],s.asInstanceOf[E]) < 0 => f :: merge(restFirst, second)
case (f::restFirst, s::restSecond) => s :: merge(first, restSecond)
}
l match {
case List() => return l
case List(x) => return l
case _ => {
val (first, second) = l.splitAt( l.length / 2 )
merge( sort(comparator)(first), sort(comparator)(second) )
}
}
}
}
Run Code Online (Sandbox Code Playgroud)
这不是以下更优雅的解决方案:
import scala.collection.immutable.List
object MergeSort {
def sort[T]( comparator: (T,T) => Int ) (l: List[T]): List[T] = {
def merge[T](first: List[T], second: List[T]): List[T] = (first, second) match {
case (_, List()) => first
case (List(), _) => second
case (f::restFirst, s::restSecond) if comparator(f,s) < 0 => f :: merge(restFirst, second)
case (f::restFirst, s::restSecond) => s :: merge(first, restSecond)
}
l match {
case List() => return l
case List(x) => return l
case _ => {
val (first, second) = l.splitAt( l.length / 2 )
merge( sort(comparator)(first), sort(comparator)(second) )
}
}
}
}
Run Code Online (Sandbox Code Playgroud)
哪个不编译,给我以下错误信息:
MergeSort.scala:10: type mismatch;
[error] found : f.type (with underlying type T)
[error] required: T
[error] case (f::restFirst, s::restSecond) if comparator(f,s) < 0 => f :: merge(restFirst, second)
Run Code Online (Sandbox Code Playgroud)
为什么显式强制转换是必要的,因为底层类型是T?
Tra*_*own 12
这是我能想到的最烦人的Scala陷阱之一(可能是在与运算符的分号推断相关问题之后).你是正确答案中的三个字符.
问题是类型参数merge.它引入了一个新的T阴影T类型参数sort.因此,编译器不知道comparator可以应用于该新实例T.你可以使用演员来讨论它,这就是你的第一个版本有效的原因,但是否则它会看作是T一个空白的板岩.
写信def merge(first: List[T], ...,你会没事的.