**List::Permutor - Process all possible permutations of a list**

Make the object by passing a list of the objects to be permuted. Each time that next() is called, another permutation will be returned. When there are no more, it returns the empty list....

PHOENIX/List-Permutor-0.022 - 06 Jun 1999 18:47:07 GMT - Search in distribution**List::Permutor::Repeat - Process all possible repeat permutations of a list**

This is repeat permutation. Not repeat elem permutation see Tom Phoenix's List::Permutor....

ABBYPAN/List-Permutor-Repeat-0.01 - 30 Apr 2014 02:37:46 GMT - Search in distribution**perlfaq4 - Data Manipulation**

This section of the FAQ answers questions related to manipulating numbers, dates, strings, arrays, hashes, and miscellaneous data issues....

LLAP/perlfaq-5.021011 - 04 Mar 2016 20:04:35 GMT - Search in distribution**Math::Prime::Util - Utilities related to prime numbers, including fast sieves and factoring**

A module for number theory in Perl. This includes prime sieving, primality tests, primality proofs, integer factoring, counts / bounds / approximations for primes, nth primes, and twin primes, random prime generation, and much more. This module is th...

DANAJ/Math-Prime-Util-0.65 - 03 May 2017 14:58:56 GMT - Search in distribution**Math::Counting - Combinatorial counting operations**

Compute the factorial, number of permutations, number of derangements and number of combinations. The ":big" functions are wrappers around "bfac" in Math::BigInt with a bit of arithmetic between. The student versions exist to illustrate the computati...

GENE/Math-Counting-0.1305 - 20 Oct 2015 02:48:29 GMT - Search in distribution**Algorithm::Permute - Handy and fast permutation with object oriented interface**

This handy module makes performing permutation in Perl easy and fast, although perhaps its algorithm is not the fastest on the earth. It supports permutation r of n objects where 0 < r <= n....

SLOYD/Algorithm-Permute-0.16 - 03 Aug 2017 14:19:04 GMT - Search in distribution**Math::Permute::Array - Perl extension for computing any permutation of an array. The permutation could be access by an index in [0,cardinal] or by iterating with prev, cur and next.**

This module compute the i^{th} permutation of an array recursively. The main advantage of this module is the fact that you could access to any permutation in the order that you want. Moreover this module doesn't use a lot of memory because the permut...

JNQUINTIN/Math-Permute-Array-0.043 - 18 Sep 2012 20:38:16 GMT - Search in distribution**Acme::CPANLists::Import::CombinationsAndPermutations - Short survey of modules for combinations and permutations (2015)**

This module is generated by extracting module names mentioned in the article <http://blogs.perl.org/users/dana_jacobsen/2015/02/short-survey-of-modul es-for-combinations-and-permutations.html> (retrieved on 2016-07-19). For the full article, visit th...

PERLANCAR/Acme-CPANLists-Import-0.03 - 27 Dec 2016 18:54:25 GMT - Search in distribution