使用精炼,我试图定义f
:
import eu.timepit.refined._
import eu.timepit.refined.api.Refined
import eu.timepit.refined.auto._
import eu.timepit.refined.numeric._
// if action 'succeeds', return 'good'; otherwise re-try, subtracting count by 1
scala> def f[A](action: => A, success: A => Boolean, count: Int Refined Positive): String =
| if( success(action) ) "good" else f(action, success, count - 1)
<console>:32: error: compile-time refinement only works with literals
if( success(action) ) "good" else f(action, success, count - 1)
^
由于这不起作用,我采取了:
def fEither[A](action: => A, success: A => Boolean, count: Either[String, Int Refined Positive]): String = {
println(count)
if( success(action) ) "good"
else {
count match {
case Right(c) => fEither(action, success, refineV[Positive](c - 1))
case Left(_) => "bad"
}
}
}
scala> fEither[Int](42, _ => false, Right( refineMV[Positive]( 2 ) ) )
Right(2)
Right(1)
Left(Predicate failed: (0 > 0).)
res2: String = bad
理想情况下,我想将此Idris程序转换为Scala:
f : (action : a) -> (success: a -> Bool) -> (n : Nat) -> String
f action success (S n) = if (success action) then "good" else f action success n
f _ _ Z = "bad"
*scratch> f 42 (const False) 2
"bad" : String
*scratch> f 42 (const False) 0
"bad" : String
但我不确定Nat
能力上的任何模式匹配。
答案 0 :(得分:2)
NonNegative
,因此0
是有效值。n - 1
是否仍然是自然数,因此您可以使用运行时版本refineV
直接执行此操作:def f[A](action: => A, success: A => Boolean, count: Int Refined NonNegative): String =
refineV[NonNegative](count - 1) match {
case Right(n) => if (success(action)) "good" else f(action, success, n)
case Left(_) => "bad"
}
P.S。您可能需要多个参数列表b / c Scala可能无法在呼叫站点正确推断A
的类型