Beefy Boxes and Bandwidth Generously Provided by pair Networks
Perl Monk, Perl Meditation

Re^5: Efficient Unique Nested Combinations

by Moron (Curate)
on Jun 28, 2007 at 11:29 UTC ( #623854=note: print w/ replies, xml ) Need Help??

in reply to Re^4: Efficient Unique Nested Combinations
in thread Efficient Unique Nested Combinations

No I meant to just iterate nested next-combinations but it comes to my attention that actually both loops were degenerate (nCn and nC1) so that M::C would be doing nothing more than returning next elements in arrays, which might as well be handrolled anyway. To assure unique selections from inner arrays, the OPs hash idea seems now as good as any.

Comment on Re^5: Efficient Unique Nested Combinations

Log In?

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

How do I use this? | Other CB clients
Other Users?
Others making s'mores by the fire in the courtyard of the Monastery: (5)
As of 2015-11-28 02:05 GMT
Find Nodes?
    Voting Booth?

    What would be the most significant thing to happen if a rope (or wire) tied the Earth and the Moon together?

    Results (737 votes), past polls