Rap*_*oth 3 generics scala numeric
我想修改这里给出的代码:Find min and max elements of array
def minMax(a: Array[Int]) : (Int, Int) = {
if (a.isEmpty) throw new java.lang.UnsupportedOperationException("array is empty")
a.foldLeft((a(0), a(0)))
{ case ((min, max), e) => (math.min(min, e), math.max(max, e))}
}
Run Code Online (Sandbox Code Playgroud)
也可以使用Long, Floatand Double(因为这些是 scala.math.min/max 接受的类型。我试过:
def getMinAndMax[@specialized(Int,Long,Float,Double) T](x: Seq[T]) : (T, T) = {
if (x.isEmpty) throw new java.lang.UnsupportedOperationException("seq is empty")
x.foldLeft((x.head, x.head))
{ case ((min, max), e) => (math.min(min, e), math.max(max, e))}
}
Run Code Online (Sandbox Code Playgroud)
但这也不能编译。有什么建议吗?
你想要一个typeclass。具体来说,在这种情况下,您需要Ordering来自 stdlib。
// It is more idiomatic to return an Option rather than throwing an exception,
// that way callers may decide how to handle that case.
def getMinAndMax[T : Ordering](data: IterableOnce[T]): Option[(T, T)] = {
import Ordering.Implicits._ // Provides the comparison operators: < & >
data.iterator.foldLeft(Option.empty[(T, T)]) {
case (None, t) =>
Some((t, t))
case (current @ Some((min, max)), t) =>
if (t < min) Some((t, max))
else if (t > max) Some((min, t))
else current
}
}
Run Code Online (Sandbox Code Playgroud)
您可以在此处看到运行的代码。
| 归档时间: |
|
| 查看次数: |
65 次 |
| 最近记录: |