hg: lambda/lambda/jdk: Modify the conc-Node spliterator forEach and tryAdvance from using the call

[Edward Harned]

Is the stack problem for serial, parallel or both?

Do you have an example for where the problem lies? (a little stack trace
maybe)


On Mon, Feb 18, 2013 at 9:10 AM, <paul.sandoz at oracle.com> wrote:

> Changeset: 66c0dd07e288
> Author:    psandoz
> Date:      2013-02-18 15:09 +0100
> URL:       http://hg.openjdk.java.net/lambda/lambda/jdk/rev/66c0dd07e288
>
> Modify the conc-Node spliterator forEach and tryAdvance from using the call
> stack to using an explicit (Deque) stack and a depth first search to
> find leaf nodes. This avoids stack overflow expceptions with tryAdvance
> and forEach for right-balanced or degenerate treess. This also avoids
> the internal creation of n spliterators when using tryAdvance, where n is
> the
> depth of the tree.
>
> ! src/share/classes/java/util/stream/Nodes.java
>
>
>