4 ms·

I ran out of JS stack, walking the dependency graph of a big computation. Dependency graphs can be very deep relative to their overall size. It was a big pain t

by tlb 4y ago

I ran out of JS stack, walking the dependency graph of a big computation. Dependency graphs can be very deep relative to their overall size. It was a big pain to rewrite with an explicit stack of to-be-visited nodes. TCO wouldn't have saved me, though. It just needs a big stack. Node defaults to just under 1 MB, which doesn't go very far.

dgb23 4y ago
That's interesting and quite valid, haven't thought of this. And I agree, recursion is often more intuitive and concise for these things.
z3t4 4y ago
Rewriting a recursive function into a for-loop can be mind boggling, but you often end up with more simple code.