If you try to define a recursive function without a type, you will get this error:<\/p>\n
\nerror: recursive value count needs type\n<\/pre>\nFor example, note how this “count” value doesn’t have a type:<\/p>\n
\nval count = \n (values: Seq[Any]) => { \n values.headOption match { \n case Some(_) => 1 + count(values.tail) \n case None => 0 \n }\n }\n<\/pre>\nThe fix is fairly simple (although the type is hard to read):<\/p>\n
\nval count: (Seq[Any]) => Int = \n ...\n<\/pre>\nI found in doing this that I had to switch from “Seq” to “Seq[Any]”. The “=>” differentiates the arguments (on the left, in parens) from the return type (on the right). The reason for this is that the type inference algorithm isn’t set up to handle this – while this is a simple example, recursion that bounces back and forth between two functions is likely too much for the compiler to handle, especially when you might be returning different types through many paths.<\/p>\n","protected":false},"excerpt":{"rendered":"
If you try to define a recursive function without a type, you will get this error: error: recursive value count needs type For example, note how this “count” value doesn’t have a type: val count = (values: Seq[Any]) => { values.headOption match { case Some(_) => 1 + count(values.tail) case None => 0 } } … <\/p>\n