in reply to possible combinations in sequence
ruzam:
Here's my stab at it. I took out the hash because my method doesn't generate duplicates. Instead I just return the list of results:
UPDATE: I didn't benchmark it because I've never used that module before. (I'll have to go install it and read up on it.) But I submitted it because I suspect that generating the strings from components might be faster than removing chunks. Any benchmarking ninjas out there wanna help me out?#!/usr/bin/perl -w use strict; use warnings; # initial source in sequence order my $source = 'horse:cow:dog:cat'; function($source); # and now the results foreach (function($source)) { print "$_\n"; } # generate array of combinations sub function { my @t = split /:/, shift; my @res=(shift @t); for my $i (@t) { @res=($i, @res, map{$_.':'.$i} @res); } return @res; }
--roboticus
|
---|
Replies are listed 'Best First'. | |
---|---|
Re^2: possible combinations in sequence
by ikegami (Patriarch) on Jun 09, 2006 at 06:04 UTC | |
by roboticus (Chancellor) on Jun 09, 2006 at 12:10 UTC | |
by ruzam (Curate) on Jun 09, 2006 at 14:15 UTC | |
by roboticus (Chancellor) on Jun 13, 2006 at 12:23 UTC | |
Re^2: possible combinations in sequence
by ruzam (Curate) on Jun 09, 2006 at 05:39 UTC |
In Section
Cool Uses for Perl