Algorithm-Pair-Best2
view release on metacpan or search on metacpan
lib/Algorithm/Pair/Best2.pm view on Meta::CPAN
### my $idx = 0;
### while ($idx < @idxs) {
### if (exists $seen{$idxs[$idx]} or exists $seen{$idxs[$idx + 1]}) {
### croak("Duplicate index");
### }
### $seen{$idxs[$idx]} = $seen{$idxs[$idx + 1]} = 1;
### push @pairs, join '-', sort $idxs[$idx], $idxs[$idx + 1];
### $idx += 2;
### }
### my $key = join ',', sort @pairs;
### # $key = ' ' x (25 - length $key) . $key;
### return $key;
### }
###
#### you might want to adjust this for your items...
### sub print_items {
### my ($self, @idxs) = @_;
###
### return join ', ', map { $self->{items}[$_]->id } @idxs;
### }
( run in 0.257 second using v1.01-cache-2.11-cpan-a9ef4e587e4 )