Re^2: intersection of N arrays

Wouldn't this fail if the same element appears mulitple times in an array, such that the number of times it appears overall is == num of arrays? This code assumes all elements are unique in each array.

The next solution has the same assumption.

A quick look at the source of List::Compare leads me to think it does not make that assumption.

--Solo --
You said you wanted to be around when I made a mistake; well, this could be it, sweetheart.

Comment on Re^2: intersection of N arrays

Replies are listed 'Best First'.
Re^3: intersection of N arrays by jarich (Curate) on Jul 07, 2004 at 15:14 UTC
Wouldn't this fail if the same element appears mulitple times in an array, such that the number of times it appears overall is == num of arrays? This code assumes all elements are unique in each array. The provided code does not make that assumption. The key lines are: `foreach my $k (keys %ids) { my %uniq = map { $_ => 1 } @{ $ids{$k} }; $count[$_]++ for keys %uniq; }` [download] If the array in $ids{$k} has a whole bunch of 1s in it, that's okay, we'll overwrite $uniq{1} a whole bunch of times. Because hash keys must be unique. This means that at the last statement in this loop %uniq will represent a hash with only the unique values from $ids{$k} I hope this helps. jarich	[reply] [d/l]

Replies are listed 'Best First'.

Re^3: intersection of N arrays
by jarich (Curate) on Jul 07, 2004 at 15:14 UTC

Wouldn't this fail if the same element appears mulitple times in an array, such that the number of times it appears overall is == num of arrays? This code assumes all elements are unique in each array.

The provided code does not make that assumption. The key lines are:

foreach my $k (keys %ids) {
    my %uniq = map { $_ => 1 } @{ $ids{$k} };
    $count[$_]++ for keys %uniq;
}
[download]

keys

This means that at the last statement in this loop %uniq will represent a hash with only the unique values from $ids{$k}

I hope this helps.

jarich

[reply]
[d/l]