aboutsummaryrefslogtreecommitdiff
path: root/devel/p5-Algorithm-Numerical-Shuffle
Commit message (Collapse)AuthorAgeFilesLines
* support STAGEDIR.Vanilla I. Shu2013-10-272-3/+1
| | | | Notes: svn path=/head/; revision=331766
* Add NO_STAGE all over the place in preparation for the staging support (cat: ↵Baptiste Daroussin2013-09-201-0/+1
| | | | | | | devel part 3) Notes: svn path=/head/; revision=327724
* - Convert to new perl frameworkAndrej Zverev2013-08-021-1/+2
| | | | Notes: svn path=/head/; revision=324171
* - Update to version 2009110301Martin Wilke2013-05-152-5/+6
| | | | | | | | | | - Add license PR: 178580 Submitted by: Ports Fury Notes: svn path=/head/; revision=318224
* - Reassign to the heap at maintainer's requestThomas Abthorpe2012-09-251-6/+2
| | | | Notes: svn path=/head/; revision=304807
* -remove MD5Olli Hauer2011-07-031-1/+0
| | | | Notes: svn path=/head/; revision=276999
* - Take advantage of CPAN macro from bsd.sites.mk, change ↵Marcelo Araujo2008-04-171-2/+1
| | | | | | | | | | | | ${MASTER_SITE_PERL_CPAN} to CPAN. PR: ports/122674 Submitted by: Philip M. Gollucci <pgollucci@p6m7g8.com> Reworked by: araujo (myself) Approved by: portmgr (pav) Notes: svn path=/head/; revision=211450
* SHA256ifyEdwin Groothuis2006-01-221-0/+1
| | | | | | | Approved by: krion@ Notes: svn path=/head/; revision=154141
* Replace ugly "@unexec rmdir %D... 2>/dev/null || true" with @dirrmtryEdwin Groothuis2006-01-221-4/+4
| | | | | | | | Approved by: krion@ PR: ports/88711 (related) Notes: svn path=/head/; revision=154110
* SIZEify (maintainer timeout)Trevor Johnson2004-03-311-0/+1
| | | | Notes: svn path=/head/; revision=105747
* Add p5-Algorithm-Numerical-Shuffle 1.4, shuffle a list.Erwin Lansing2003-08-204-0/+45
Shuffle is a perl module which performs a one pass, fair shuffle on a list. If the list is passed as a reference to an array, the shuffle is done in situ. The running time of the algorithm is linear in the size of the list. For an in situ shuffle, the memory overhead is constant; otherwise, linear extra memory is used. The algorithm used is discussed by Knuth [3]. It was first published by Fisher and Yates [2], and later by Durstenfeld [1]. PR: 55574 Submitted by: andrew@scoop.co.nz Notes: svn path=/head/; revision=87333