Sort::External - Sort huge lists.
Problem: You have a list which is too big to sort in-memory. Solution: "feed, finish, and fetch" with Sort::External, the closest thing to a drop-in replacement for Perl's sort() function when dealing with unmanageably large lists. How it works Cache...CREAMYG/Sort-External-0.18 - 04 Sep 2008 02:50:35 UTC
Sort::Key - the fastest way to sort anything in Perl
Sort::Key provides a set of functions to sort lists of values by some calculated key value. It is faster (usually much faster) and uses less memory than other alternatives implemented around perl sort function (ST, GRT, etc.). Multi-key sorting funct...SALVA/Sort-Key-1.33 - 29 Apr 2014 11:55:23 UTC
Sort::TSort - topological sort; a very simple wrapper around 'tsort' command line utility.
Sort::TSort::tsort performs a topological sort of an acyclic directed graph defined by list of edges (pairs of vertices). Sort::TSort does this by invoking external command tsort (1). Exports one subroutine on demand: tsort. If external program tsort...HELENA/Sort-TSort-0.01 - 04 Jul 2015 19:18:58 UTC
Sort::Bucket - a fast XS bucket sort
A fast XS implementation of the Bucket Sort algorithm. If your data is well suited to a bucket sort then this can be significantly faster than Perl's builtin sort() function. A bucket sort works best when there is a large amount of variation in the f...NCLEATON/Sort-Bucket-0.02 - 08 Feb 2010 19:38:42 UTC
This is by far and away the most evil member of the Wordlists family (it's also pretty much unrelated to all the others). It is basically a terse way of writing complex comparison/sort functions as one liners (if you want to). The intention is to be ...PERRETTDL/WordLists-0.013 - 06 Jul 2012 08:34:37 UTC
Sort::Topological - Topological Sort
Sort::Topological does a topological sort of an acyclical directed graph....KSTEPHENS/Data-Match-0.06 - 18 Dec 2002 09:20:36 UTC