| Commit message (Collapse) | Author | Age | Files | Lines |
|
|
|
| |
Notes:
svn path=/head/; revision=331766
|
|
|
|
|
|
|
| |
devel part 3)
Notes:
svn path=/head/; revision=327724
|
|
|
|
| |
Notes:
svn path=/head/; revision=324171
|
|
|
|
|
|
|
|
|
|
| |
- Add license
PR: 178580
Submitted by: Ports Fury
Notes:
svn path=/head/; revision=318224
|
|
|
|
| |
Notes:
svn path=/head/; revision=304807
|
|
|
|
| |
Notes:
svn path=/head/; revision=276999
|
|
|
|
|
|
|
|
|
|
|
|
| |
${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
|
|
|
|
|
|
|
| |
Approved by: krion@
Notes:
svn path=/head/; revision=154141
|
|
|
|
|
|
|
|
| |
Approved by: krion@
PR: ports/88711 (related)
Notes:
svn path=/head/; revision=154110
|
|
|
|
| |
Notes:
svn path=/head/; revision=105747
|
|
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
|