Beefy Boxes and Bandwidth Generously Provided by pair Networks
Don't ask to ask, just ask
 
PerlMonks  

Re: Efficient but elegant Cross-Product iterator ?

by Corion (Patriarch)
on Jun 20, 2020 at 19:50 UTC ( [id://11118283]=note: print w/replies, xml ) Need Help??


in reply to Efficient but elegant Cross-Product iterator ?

I'm not sure from your description, but what you want sounds very much like Algorithm::Loops::NestedLoops, which takes subroutines to create loops and nests those to create the data structure (as another iterator).

  • Comment on Re: Efficient but elegant Cross-Product iterator ?

Replies are listed 'Best First'.
Re^2: Efficient but elegant Cross-Product iterator ?
by LanX (Saint) on Jun 20, 2020 at 21:22 UTC
    Thanks, pretty close but not exactly what I'm trying to achieve in the end.

    Some interesting ideas though.

    The code looks like written by an experienced C programmer.° ;)

    One point with "when" looks buggy, will need to install and test.

    Didn't know it's possible to use isa instead of ref to test for a CODE ref (?) Strange!

    Cheers Rolf
    (addicted to the Perl Programming Language :)
    Wikisyntax for the Monastery

    °) hey Tye, where are you? :)

[reply]

In Section Seekers of Perl Wisdom

Log In?
Username:
Password:

What's my password?
Create A New User
Domain Nodelet?

www.com | www.net | www.org
Node Status?
node history
Node Type: note [id://11118283]
help
Chatterbox?
and the web crawler heard nothing...

How do I use this? • Last hour • Other CB clients
Other Users?
Others chanting in the Monastery: (3)
As of 2024-04-24 16:28 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    No recent polls found