Algorithm-Combinatorics
view release on metacpan or search on metacpan
Revision history for Algorithm-Combinatorics
0.27 Feb 10 2012
* No code changes, just copyright updates. Indicates also
the module is not abandoned.
0.26 Jan 28 2011
* Fixes a memory leak in subsets(), thanks to Oliver Seeliger. [closes RT#65207]
* Updates Copyright.
* README documents now the module itself, better for GitHub.
0.25 Nov 30 2007
* Improved speed of subsets() copying the algorithm in List::PowerSet.
0.24 Jul 14 2007
* Added subsets().
0.23 May 19 2007
* We do not longer assume indices com to XS as IVs, that broke
partitions() in 5.6.2.
* Small touches to the code.
* Added a few tests.
0.22 May 15 2007
* The previous release was built with Apple's version of tar, which
adds some custom extra files that prevent building the module in some
systems. I built this one with GNU tar.
0.21 May 14 2007
* Added a directory with some benchmarks.
* A maintenance release to indicate the module is maintained.
0.20 June 6 2006
* Jumped version to 0.2x.
* Added pointer to Sloane's encyclopedia for the sequence of
numbers of circular permutations
* Added complete_permutations().
* Simplified explanation of circular permutations.
0.16 June 5 2006
* Added circular_permutations().
* Added some pointers to The On-Line Encyclopedia of Integer Sequences
* Added a few more tests for partitions().
0.15 May 23 2006
* Added partitions().
* Added some comments.
0.14 December 19 2005
* Small rewordings in POD.
* Added TAOCP Vol 4, Fasc 3 to REFERENCES.
* Added tuples* as alias to variations* to add the nomenclature
in Knuth's, Mathematica, etc. to the interface.
( run in 1.907 second using v1.01-cache-2.11-cpan-2398b32b56e )