in reply to Re: Howto Avoid Memory Problem in List::MoreUtils
in thread Howto Avoid Memory Problem in List::MoreUtils

Sort::External could be a good option for that also.

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.

  • Comment on Re^2: Howto Avoid Memory Problem in List::MoreUtils