in reply to Basic Perl array intersection faster than mysql query join.
and then finding the intersection of two or more arrays.select col_2 from theTable where col_1 = $some_value;
In that case, I am on a mission to find the absolutely most efficient array-interesection-finder routine possible. Yes, I've read and tried solutions from perlfaq4, and variations found by a search here on PM. I wonder if for the very specific application of two lists, each between 4,000 and 10,000 elements long, there isn't some ultra-simple and rapid approach.
|
|---|
| Replies are listed 'Best First'. | |
|---|---|
|
Re^2: Basic Perl array intersection faster than mysql query join.
by dragonchild (Archbishop) on Oct 12, 2004 at 17:40 UTC |