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 GMT

lib/RPerl/Algorithm/Sort/Merge.pm River stage one • 2 direct dependents • 2 total dependents

WBRASWELL/RPerl-4.002000 - 15 Nov 2018 12:04:43 GMT

Sort::MergeSort - merge pre-sorted input streams River stage one • 2 direct dependents • 2 total dependents

Given a comparison function and a bunch of iterators that produce data that is already sorted, "mergesort()" will provide an iterator that produces sorted and merged data from all of the input iterators. Sort::MergeSort also works with filehandles. I...

MUIR/Sort-MergeSort-0.31 - 11 Oct 2013 01:02:28 GMT

Sort::MergeSort::Iterator - iteration object River stage one • 2 direct dependents • 2 total dependents

This class implements a simple iterator interface for iterating over items. Just pass a code reference to the constructor that returns the next value over which to iterate. Sort::MergeSort::Iterator will do the rest. FileHandle Interface You can pret...

MUIR/Sort-MergeSort-0.31 - 11 Oct 2013 01:02:28 GMT

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

With the "sort" pragma you can control the behaviour of the builtin "sort()" function. In Perl versions 5.6 and earlier the quicksort algorithm was used to implement "sort()", but in Perl 5.8 a mergesort algorithm was also made available, mainly to g...

SHAY/perl-5.26.1 - 22 Sep 2017 21:30:18 GMT

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 GMT

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 GMT

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 GMT

Sort::Bucket - a fast XS bucket sort River stage zero No dependents

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 GMT

Sort::External - Sort huge lists. River stage one • 4 direct dependents • 4 total dependents

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 GMT

WordLists::Sort River stage zero No dependents

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 GMT

Sort::Key::Radix - Radix sort implementation in XS River stage one • 1 direct dependent • 1 total dependent

This module reimplements some of the funcions in the Sort::Key module using a Radix sort as the sorting algorithm. For some kinds of data (for instance large data sets of small integers, postal codes, logins, serial numbers, dates, etc.) it can be fa...

SALVA/Sort-Key-Radix-0.14 - 16 Apr 2012 11:20:35 GMT

Sort::Key::Merger - Perl extension for merging sorted things River stage zero No dependents

Sort::Key::Merger allows to merge presorted collections of *things* based on some (calculated) key. EXPORT None by default. The functions described below can be exported requesting so explicitly, i.e.: use Sort::Key::Merger qw(keymerger); FUNCTIONS k...

SALVA/Sort-Key-Merger-0.08 - 13 May 2005 08:59:30 GMT

13 results (0.062 seconds)