Recursive function causing a stack overflow

by

You’re being hit by filter‘s laziness. Change (filter ...) to (doall (filter ...)) in your recur form and the problem should go away.

A more in-depth explanation:

The call to filter returns a lazy seq, which materialises actual elements of the filtered seq as required. As written, your code stacks filter upon filter upon filter…, adding one more level of filtering at each iteration; at some point this blows up. The solution is to force the whole result at each iteration so that the next one will do its filtering on a fully realised seq and return a fully realised seq instead of adding an extra layer of lazy seq processing; that’s what doall does.

More Related Contents:

  1. How Are Lazy Sequences Implemented in Clojure?
  2. Way to go from recursion to iteration
  3. Solution for “Fatal error: Maximum function nesting level of ‘100’ reached, aborting!” in PHP
  4. Determining complexity for recursive functions (Big O notation)
  5. Tower of Hanoi: Recursive Algorithm
  6. Prolog Accumulators. Are they really a “different” concept?
  7. What is recursion and when should I use it?
  8. How can I make recursive templates in AngularJS when using nested objects?
  9. Explain this chunk of haskell code that outputs a stream of primes
  10. Is Cmake set variable recursive?
  11. “application: not a procedure” in binary arithmetic procedures
  12. count the number of calls of a clause
  13. recursive variadic template to print out the contents of a parameter pack
  14. New state of the art in unlimited generation of Hamming sequence
  15. Is a Recursive-Iterative Method Better than a Purely Iterative Method to find out if a number is prime?
  16. Recursion vs loops
  17. double stream feed to prevent unneeded memoization?
  18. How do I avoid Clojure’s chunking behavior for lazy seqs that I want to short circuit?
  19. Lazy lists in Prolog?
  20. Real-world examples of recursion [closed]
  21. How to convert lazy sequence to non-lazy in Clojure
  22. Implications of foldr vs. foldl (or foldl’)
  23. How does the fibonacci recursive function “work”?
  24. Examples of Recursive functions [closed]
  25. Is it possible to make a recursive closure in Rust?
  26. Fast Prime Number Generation in Clojure
  27. Understanding a recursively defined list (fibs in terms of zipWith)
  28. What does “Overflow evaluating the requirement” mean and how can I fix it?
  29. SICP recursive process vs iterative process: using a recursive procedure to generate an iterative process
  30. Which recursive functions cannot be rewritten using loops? [duplicate]

Leave a Comment