Scala:(Int,Int)=> Int不匹配(Int,Int)=> Int

ram*_*ion 5 scala y-combinator greatest-common-divisor

我正在尝试使用y-combinator在scala中定义gcd:

object Main {
  def y[A,B]( f : (A => B) => A => B ) : A => B = f(y(f))
  def gcd = y[(Int,Int),Int]( (g) => (x,y) => if (x == 0) y else g(y % x, x) )
}
Run Code Online (Sandbox Code Playgroud)

但我收到一个错误:

Main.scala:3: error: type mismatch;                                                  
 found   : (Int, Int) => Int                                                               
 required: (Int, Int) => Int                                                               
    def gcd = y[(Int,Int),Int]( (g) => (x :Int,y :Int) => if (x == 0) y else g(y % x, x) ) 
                                                       ^
Run Code Online (Sandbox Code Playgroud)

如果我讨论所有的论点,那就没有问题:

def gcd = y[Int,Int => Int]( g => x => y => if (x == 0) y else g(y % x)(x) )
Run Code Online (Sandbox Code Playgroud)

在未经证实的版本中,我做错了什么?

Dyl*_*lan 9

有点(g) => (x :Int,y :Int) =>.Scala期望你的参数是(Int,Int)的元组,所以它会更像(g) => (tup: (Int, Int)) =>

您可以使用一些模式匹配来避免在tup上使用_1_2匹配.这对我来说很好:

def gcd = y[(Int, Int), Int](g => {
  case (x,y) => if(x == 0) y else g(y % x, x)
})
Run Code Online (Sandbox Code Playgroud)

  • 如果有人遵循这个,`def y[A,B]( f : (A => B) => A => B ) : A => B = f(y(f))` 应该写成`def y[A,B]( f : (A => B) => A => B ) : A => B = f(y(f))(_:A)` 否则,你会得到`StackOverflowError` (2认同)