Or, comming back to the hash aproach used by List::MoreUtils::uniq, using an in disk tree as provided by DB_File could be a faster solution specially if the number of duplicates is high.
In reply to Re^2: Howto Avoid Memory Problem in List::MoreUtils
by salva
in thread Howto Avoid Memory Problem in List::MoreUtils
by Anonymous Monk
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |