Beefy Boxes and Bandwidth Generously Provided by pair Networks
Clear questions and runnable code
get the best and fastest answer
 
PerlMonks  

Re^3: How can one generate all possible combinations with reference to string positions?

by kennethk (Abbot)
on Feb 25, 2013 at 15:37 UTC ( #1020535=note: print w/ replies, xml ) Need Help??


in reply to Re^2: How can one generate all possible combinations with reference to string positions?
in thread How can one generate all possible combinations with reference to string positions?

The transform 3-$l only works if you are working with 1 and 2 as your permuted set; it happens that for that set 3-$l is equivalent to "the member of the set that is not $l". If you need any degree of flexibility, you should follow the code in Re: How can one generate all possible combinations with reference to string positions?, subject to BrowserUK's comments.


#11929 First ask yourself `How would I do this without a computer?' Then have the computer do it the same way.


Comment on Re^3: How can one generate all possible combinations with reference to string positions?
Select or Download Code

Log In?
Username:
Password:

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

How do I use this? | Other CB clients
Other Users?
Others avoiding work at the Monastery: (7)
As of 2015-07-06 09:33 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    The top three priorities of my open tasks are (in descending order of likelihood to be worked on) ...









    Results (71 votes), past polls