I'm away from a Clojure REPL to poke at this but I think trapping this in a
debugger would trivially reveal the source of recursion. Set a breakpoint at
the start of the loop and step through. If using Cursive / IntelliJ set a
breakpoint to detect StackOverflow and inspect the call stack.
>
Crazy! I re-wrote the (loop) to use (reduce) instead and now everything
works:
(defn loop-over-scores
[set-of-scores]
"2017-03-08 -- called from start.clj"
(reduce
;; 2017-04-01 -- we assume vector-with-path-score looks like this:
;; [[:positive :true 0.88 19 60 10 12 3 1 3 1 2 1]
Well, I am out of ideas. Let's assume I'll re-write this some other way.
What would be better than using (loop)? What would be less likely to cause
StackOverflow, or at least reveal why I'm seeing it.
On Saturday, April 1, 2017 at 6:23:29 PM UTC-4, piast...@gmail.com wrote:
>
>
> I have a func
So for instances, starting with an object that has about 32,000 lines that
need to be looped over, the code gets this far:
in loop-over-scores again 2375
It prints that out and then throws StackOverflow error.
But I don't see anything in there that would exhaust the stack. These
functions r
I have a function that will run repeatedly, so I use the at-at library to
call it:
https://github.com/overtone/at-at
I don't think this is the problem.
Sad to say, the Error is catching a StackOverflow, which I'm having trouble
finding. I don't see a place where I call a function recursively
