sort - perl pragma to control sort() behaviour River stage five • 10599 direct dependents • 31292 total dependents

With the "sort" pragma you can control the behaviour of the builtin "sort()" function. A stable sort means that for records that compare equal, the original input ordering is preserved. Stability will matter only if elements that compare equal can be...

SHAY/perl-5.32.1 - 23 Jan 2021 14:56:24 UTC

sort - perl pragma to control sort() behaviour River stage five • 10599 direct dependents • 31292 total dependents

With the "sort" pragma you can control the behaviour of the builtin "sort()" function. A stable sort means that for records that compare equal, the original input ordering is preserved. Stability will matter only if elements that compare equal can be...

XSAWYERX/perl-5.32.0 - 20 Jun 2020 20:38:54 UTC

PL::sort River stage zero No dependents

Implements polish sorting conventions, indepentent on current locales in effect, which are often bad....

STRZELEC/PL-sort-0.2 - 04 Jun 2013 14:33:16 UTC

Cz::Sort - Czech sort River stage zero No dependents

Implements czech sorting conventions, indepentent on current locales in effect, which are often bad. Does the four-pass sort. The idea and the base of the conversion table comes from Petr Olsak's program csr and the code is as compliant with CSN 97 6...

JANPAZ/Cstools-3.44 - 13 Apr 2019 06:41:21 UTC

Sort::XS - a ( very ) fast XS sort alternative for one dimension list River stage zero No dependents

This module provides several common sort algorithms implemented as XS. Sort can only be used on one dimension list of integers or strings. It's goal is not to replace the internal sort subroutines, but to provide a better alternative in some specific...

ATOOMIC/Sort-XS-0.30 - 20 Jan 2012 19:20:06 UTC

No::Sort - Norwegian sorting River stage one • 1 direct dependent • 2 total dependents

This module provde the function no_sort() which sort a ISO-8859/1 encoded string according to Norwegian practice. The routine works like the normal perl sort routine, but the optional first argument is special. It can either be a reference to the str...

GAAS/Norge-1.08 - 21 May 2004 10:53:02 UTC

PYX::Sort - Processing PYX data or file and sort element attributes. River stage one • 1 direct dependent • 1 total dependent

SKIM/PYX-Sort-0.03 - 21 Oct 2015 13:04:16 UTC

Sub::Sort - Dummy module to catch Sort::Sub typo River stage three • 21 direct dependents • 103 total dependents

PERLANCAR/Sort-Sub-0.120 - 24 May 2020 18:12:50 UTC

Sort::SQL - manipulate SQL sort strings River stage two • 9 direct dependents • 27 total dependents

Sort::SQL is so simple it almost doesn't deserve to be on CPAN. But since I kept finding myself copy/pasting this method into multiple places, I finally figured it deserved to live in its own class....

KARMAN/Sort-SQL-0.08 - 30 Nov 2009 02:13:15 UTC

Sort::Key - the fastest way to sort anything in Perl River stage two • 16 direct dependents • 21 total dependents

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::Sub - Collection of sort subroutines River stage three • 21 direct dependents • 103 total dependents

Sort::Sub and "Sort::Sub::*" are a convenient packaging of any kind of subroutine which you can use for "sort()". To use Sort::Sub, you import a list of: ["$"]NAME [ "<" [i][r] ">" ] Where NAME is actually searched under "Sort::Sub::*" namespace. For...

PERLANCAR/Sort-Sub-0.120 - 24 May 2020 18:12:50 UTC

Sort::Tree - Organize list of objects into parent/child order. River stage zero No dependents

Sort::Tree includes three routines, list_to_tree, tree_to_list and traverse. These are used to organize an unordered list of objects into a tree form. For example, you'd perform a database query to gain a list of folders in a document system, and the...

BRYCE/Sort-Tree-1.09 - 06 May 2004 21:03:17 UTC

Sort::Hash - get the keys to a hashref sorted by their values. River stage one • 1 direct dependent • 1 total dependent

Get the keys to a hashref sorted by their values....

BRAINBUZ/Sort-Hash-2.05 - 28 Jul 2014 16:44:56 UTC

File::Sort - Sort a file or merge sort multiple files River stage one • 1 direct dependent • 1 total dependent

This module sorts text files by lines (or records). Comparisons are based on one or more sort keys extracted from each line of input, and are performed lexicographically. By default, if keys are not given, sort regards each input line as a single fie...

CNANDOR/File-Sort-1.01 - 23 Jan 2002 05:12:37 UTC

Sort::Rank - Sort arrays by some score and organise into ranks. River stage zero No dependents

Typically when presenting positions in some league or popularity chart or formatting a table of examination results entries with the same score are grouped together by rank like this: ======================== Pos Score Name ======================== 1...

ANDYA/Sort-Rank-v0.0.2 - 23 Feb 2007 18:26:55 UTC

Sort::Maker - A simple way to make efficient sort subs River stage two • 1 direct dependent • 16 total dependents

This module has two main goals: to make it easy to create correct sort functions, and to make it simple to select the optimum sorting algorithm for the number of items to be sorted. Sort::Maker generates complete sort subroutines in one of four style...

URI/Sort-Maker-0.06 - 07 Jan 2007 05:54:36 UTC

Sort::TSort - topological sort; a very simple wrapper around 'tsort' command line utility. River stage zero No dependents

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::Radix - A multiple passes distribution sort algorithm River stage zero No dependents

This is an implementation based on Jarkko's Wolf book (Mastering Algorithms with Perl, pp. 145-147). By definition: radix sort is a multiple pass distribution sort algorithm that distributes each item to a bucket according to part of the item's key b...

EWIJAYA/Sort-Radix-0.04 - 22 Jan 2005 04:28:28 UTC

Sort::Merge - general merge sort River stage zero No dependents

Merge sorting is a technique for merging together multiple input streams, each of which is sorted, into one larger output stream, still sorted. This module implements that algorithm. Note the large caveat above: the inputs must already be sorted. If ...

JMASTROS/Sort-Merge-0.01 - 08 Dec 2003 17:07:13 UTC

Sort::Array - This extended sorting algorithm allows you to River stage zero No dependents

Sort_Table() is capable of sorting table-form arrays by a particular value. Discard_Duplicates() discards doubles from an array and returns the sorted array. Usage @data = Sort_Table( cols => '4', field => '4', sorting => 'descending', structure => '...

MIDI/Sort-Array-0.26 - 25 Aug 2001 14:00:51 UTC
193 results (0.027 seconds)