Syntactic Confectionery Delight | |
PerlMonks |
Re: Compare two index listsby monktim (Friar) |
on Aug 11, 2003 at 17:19 UTC ( [id://282949]=note: print w/replies, xml ) | Need Help?? |
The data set seems small enough. You can store all the list data in a hash. Since the hash key is unique you won't hjave duplicate data when you get the keys. You can use the value field to store the number of times the data is found.
In Section
Seekers of Perl Wisdom
|
|