#!/usr/bin/perl -w
use strict;
use Algorithm::Loops qw(NestedLoops);
use Benchmark qw(cmpthese);


my @same = (
   [ 'a', 'a', 'a' ],
   [ 'a', 'a', 'a'  ],
   [ 'a', 'a', 'a'  ],
   [ 'a', 'a', 'a'  ],
);

my @different = (
   [ 'a', 'b', 'c' ],
   [ 'd', 'e', 'f'  ],
   [ 'g', 'h', 'i'  ],
   [ 'j', 'k', 'l'  ],
);



sub array {
    my $symbols = shift;
    my @all;
    my $iter = NestedLoops($symbols);
    my @list;
    while (@list = $iter->()) {
        my @sortedList = sort @list;
        my $listString = join ('',@sortedList);
        push @all, $listString;
        }

    my @uniq = keys %{{ map { $_ => 1 } @all }};
    my @sortedUniq = sort (@uniq);

}

sub hash {
    my $symbols = shift;
    my $iter = NestedLoops($symbols);
    my %seen;

    while (my @list = $iter->()) {
        my $listString = join ('',sort @list);
        $seen{$listString}++
    }

    my @sortedUniq = sort (keys %seen);
}

cmpthese(5000, {
    array_same => sub { array(\@same)},
    array_diff => sub { array(\@different)},
    hash_same  => sub { hash(\@same)},
    hash_diff  => sub { hash(\@different)},
});