P
PJ6
I have an algorithm that processes data recursively. When I'm testing it
works fine, but when I feed it data from the actual application, I get
"stack overflow". What bothers me is that the data my recursive processor is
seeing in production is identical to the test data; the only difference is
that now the processor must go deeper into an object model to get the values
with which it is working. I trace things through, there is no out of control
recursion. I've never seen this before, but the stack just craps out on a
legitimate path of execution. Not enough room. Before I rewrite my
processor, I'd like to know, is there a way of increasing stack depth?
I'm probably going to have dump the recursion since data can change... so
this question is more academic than anything else.
Paul
works fine, but when I feed it data from the actual application, I get
"stack overflow". What bothers me is that the data my recursive processor is
seeing in production is identical to the test data; the only difference is
that now the processor must go deeper into an object model to get the values
with which it is working. I trace things through, there is no out of control
recursion. I've never seen this before, but the stack just craps out on a
legitimate path of execution. Not enough room. Before I rewrite my
processor, I'd like to know, is there a way of increasing stack depth?
I'm probably going to have dump the recursion since data can change... so
this question is more academic than anything else.
Paul