Beefy Boxes and Bandwidth Generously Provided by pair Networks
Just another Perl shrine

Re: walking a tree

by blokhead (Monsignor)
on Nov 13, 2007 at 03:48 UTC ( #650433=note: print w/replies, xml ) Need Help??

in reply to walking a tree

Each recursive call to walktree uses the same $children statement handle. So most likely, each time a recursive call re-executes the $children statement, it clobbers whatever was pending for the caller in that statement handle. When the control returns to the caller, there is nothing left to iterate over.

If you think about how things happen sequentially, walktree only returns once $children->fetchrow fails. Then right after it returns, the first thing the caller tries to do is $children->fetchrow!

To fix this, either make new statement handles within each call to walktree, or else fetch all of the results from the $children query into an array before recursing at all.


Log In?

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://650433]
and all is quiet...

How do I use this? | Other CB clients
Other Users?
Others examining the Monastery: (4)
As of 2018-02-22 01:42 GMT
Find Nodes?
    Voting Booth?
    When it is dark outside I am happiest to see ...

    Results (288 votes). Check out past polls.