I recently read a blog post about issues with writing purely functional code in Scala. The post talked a bit about a paper addressing tail-recursion in Scala. The code example (taken from the paper) was an implementation of zip lists, called zipIndex, that was not properly tail-recursive and would result in a stack overflow for relatively small inputs. A later post from the author will look at ways of addressing the problem and I’m looking forward to reading about it.
I’m assuming the next post will do something similar to the tail-recursive factorial function.
I’d write a zip list in much the same way:
The recursion is handled with a function called
loopRecur, the name of which was inspired by Clojure’s loop and recur forms. I’ve tested the above implementation of
zipIndex with inputs of up to 100,000 elements. If this were in Clojure, the code would run much faster than the Scala.
To test the Clojure, assuming you have access to a Clojure REPL, you can run
(zipList (range 100000)) and then be amazed at how much faster the Clojure version runs compared to the Scala.