|Problems? Is your data what you think it is?|
Re^5: WWW::Mechanize problemby Limbic~Region (Chancellor)
|on Oct 20, 2005 at 16:24 UTC||Need Help??|
Sometimes, it helps to stop thinking about the problem at hand. You get too close to the problem and you miss the forest through the trees. The process I am about to explain can be applied to any similar problem and is not unique to your situation. Once you understand that - you have the tools you need to solve it yourself in the future.
Problem Description:You start out with some number of jobs to perform. In working on those jobs, you discover that you have new jobs to work on. The total number of jobs to perform can't be known ahead of time. Additionally, it is possible for one job to lead to another job which leads back to the original job. If we think of the number of known jobs at any given time as a stack or a queue, then we know we can stop work when it is empty.
When we evaluate an array in this context, it will be false when the array is empty. The while loop will terminate because all work has been completed. Inside the loop, we add to our known work queue/stack by checking to see if the job leads to more work.
We now need to consider that one job may lead back to itself and break the infinite loop.
We can additionally decide to abandon our work if we discover that our queue/stack has grown larger than we anticipated. We rely on the fact that when an array is evaluated in scalar context it returns the number of elements present.
Now it may be important to process the work in a specific order. A depth first approach is when one job leads to another job which leads to another job and they need to be processed it that order. A breadth first approach is when secondary and tertiary jobs are only executed after all primary jobs are complete. The way to control this is by adjusting what end of the stack/queue you take work off and put on. See push, pop, shift, unshift for more details.
Cheers - L~R
Update: Minor oversights corrected per the astute herveus.