Beefy Boxes and Bandwidth Generously Provided by pair Networks
Keep It Simple, Stupid

Re: How to juggle between two arrays that are not same size

by perlfan (Curate)
on Dec 19, 2007 at 20:33 UTC ( #657971=note: print w/replies, xml ) Need Help??

in reply to How to juggle between two arrays that are not same size

A straight forward way to do an intersection of two arrays (provided their elements are scalar values) is to create a hash using one array, where the keys correspond to the elements of that array. Then run over the other array, and if a key in the original hash corresponds with an element (i.e., it exists) then you've found an element in common.

The following solutions ensures all unique items in the intersection, even if both arrays contain duplicate items:
my @array1 = qw/a a b b c c d d/; my @array2 = qw/ c c d d e e f f g g/; my @array3 = (); my %filter = (); foreach (@array1) { $filter{$_} = 1; } foreach (@array2) { if (exists($filter{$_}) && 2 == ++$filter{$_}) { push(@array3,$_); } } print join(' ',@array3);
If your arrays are do not contain scalar values, i.e., array/hash/sub refs, etc; then you can write a function to pass $_ through to serialize it first.

Log In?

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://657971]
and all is quiet...

How do I use this? | Other CB clients
Other Users?
Others contemplating the Monastery: (8)
As of 2017-02-23 09:44 GMT
Find Nodes?
    Voting Booth?
    Before electricity was invented, what was the Electric Eel called?

    Results (343 votes). Check out past polls.