Clear questions and runnable code
get the best and fastest answer
Getting the intersection of n collections.by jbrugger (Parson)
|on Oct 11, 2006 at 11:47 UTC||Need Help??|
jbrugger has asked for the
wisdom of the Perl Monks concerning the following question:
I've got the following question:
I've got n arrays, that all contain data.
I want to return a new array, containing only the data, that exist in all n arrays mentioned above.
(i hope i'm clear in what i want)
Right now, my following solution works, but i wonder if there is a more clever and fast way to do this:
Thanks for all the fast replies
lima1, indeed, it has to work for duplicate items as well. (changed the example a little.)
"We all agree on the necessity of compromise. We just can't agree on when it's necessary to compromise." - Larry Wall.