Okay, I cannot resist. This is the product of not enough
sleep and I warn all who continue. Given we have used
merlyn's suggestion for a hash of arrays ( I was actually
thinking of an array of ararys, but why not a hash? ),
what if we did something like this
sub compare {
my %data = @_;
my @lengths = sort { $a <=> $b } map { scalar@{$data{$_}} } keys %da
+ta;
return $lengths[0] == $lengths[-1];
}
Basically, if we sort the lengths and the last element is
equal to the first element, then everything else inbetween
must be equal.
This has likely no value - it really isn't clearer nor does
it likely save any cycles. I just thought it was fun and
have not had enough sleep.
UPDATE: did I mention not enough sleep? Fixed a typo
mikfire
