Hi Monks, I am trying to write a function that takes a string argument $str of the form shown below (letter + weight) and need to generate all combinations with certain restrictions; for example, no repeating numbers. I also need a perlish way to move the letter $firstLetter with the largest weight into first position. The order of the other substrings do not matter. As a secondary restriction, I also want to ensure that the combination contains the substring $substring. So, for this particular $str example, [ c?6, b?2, a%3, a?1] is a valid combination.
Thank you very much for your help
use strict; use Math::Combinatorics; my $firstLetter="c"; my $str="a?1,a?2,a%3,b?2,b?3,b%5,c%4,c%5,c?6,d%2"; my $substring = "a?,b%,c?"; my @combos = Math::Combinatorics::combine(4,split ",",$str); foreach my $combo (@combos) { ## check if numbers are all unique my $hash = {}; my ($count) = grep { ++$hash->{$_} > 1 } map { (split '')[2] } @$c +ombo; next if defined $count; ## place $firstLetter with largest weight in first position ## ensure that substring strings are contained within the combinat +ion }
In reply to Combinations with constraints by Anonymous Monk
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |