Beefy Boxes and Bandwidth Generously Provided by pair Networks
Pathologically Eclectic Rubbish Lister

Re^3: NestedLoops (Algorithm::Loops) and Iterators

by tmoertel (Chaplain)
on Jul 27, 2005 at 04:06 UTC ( #478455=note: print w/replies, xml ) Need Help??

in reply to Re^2: NestedLoops (Algorithm::Loops) and Iterators
in thread NestedLoops (Algorithm::Loops) and Iterators

Can you define what you mean by "flattening" and "arbitrary depth"? My understanding of these things does not lead me to see unresolved problems in the original post. (Also, I do not believe that the NestedLoops code you provided is equivalent to seq_prod.)

In the OP's example while loop, the iterator returns scalar values. Thus I don't see how the seq_prod of such iterators could "flatten" the results: there are no intermediate array results to flatten.

On the arbitrary depth issue, if you mean that iter_prod works only for a fixed number of iterators, that is not the case. You can pass it any number of iterators, and (as long as they are independent) it will yield an iterator over their Cartesian product. If you mean something else, say that the Cartesian product is not what is desired, we can derive a suitable combinator to replace seq_prod2 and use it (with reduce) to build the desired output iterator. For example, we could define a combinator that takes the product of two iterators when the second is generated dynamically from the output of the first.


  • Comment on Re^3: NestedLoops (Algorithm::Loops) and Iterators

Log In?

What's my password?
Create A New User
Domain Nodelet?
Node Status?
node history
Node Type: note [id://478455]
and the web crawler heard nothing...

How do I use this? | Other CB clients
Other Users?
Others avoiding work at the Monastery: (2)
As of 2022-12-03 09:00 GMT
Find Nodes?
    Voting Booth?

    No recent polls found