libmath-cartesian-product-perl 1.009-1 source package in Ubuntu
Changelog
libmath-cartesian-product-perl (1.009-1) unstable; urgency=medium
[ upstream ]
* New release.
+ Results array not built in void or scalar context.
[ Jonas Smedegaard ]
* Add md5sum of upstream tarball.
* Update copyright info:
+ Extend coverage for main upstream author
+ Update email address of main upstream author.
+ Use License-Grant and License-Reference fields.
Thanks to Ben Finney.
* Add lintian override regarding license in License-Reference field.
See bug#786450.
* Bump debhelper compatibility level to 9.
* Add lintian override regarding debhelper 9.
-- Jonas Smedegaard <email address hidden> Sat, 24 Oct 2015 21:59:59 +0200
Upload details
- Uploaded by:
- Debian Perl Group
- Uploaded to:
- Sid
- Original maintainer:
- Debian Perl Group
- Architectures:
- all
- Section:
- misc
- Urgency:
- Medium Urgency
See full publishing history Publishing
| Series | Published | Component | Section | |
|---|---|---|---|---|
| Focal | release | universe | misc | |
| Bionic | release | universe | misc | |
| Xenial | release | universe | misc |
Downloads
| File | Size | SHA-256 Checksum |
|---|---|---|
| libmath-cartesian-product-perl_1.009-1.dsc | 2.2 KiB | 2c9ae6fd40f5e5052c36e3458b024483c7421b69e746dd89c1b6cfca9228e227 |
| libmath-cartesian-product-perl_1.009.orig.tar.gz | 6.1 KiB | d0bf24e56aaebe47c9db6d09c257bc3bf5af2d0d69f060fe33c180a9c7199f32 |
| libmath-cartesian-product-perl_1.009-1.debian.tar.xz | 3.2 KiB | 288a8a2159bfaca513958cffea8a0d4d2bee6e346434aab0341094e31c9c385c |
Available diffs
- diff from 1.008-2 to 1.009-1 (5.7 KiB)
No changes file available.
Binary packages built by this source
- libmath-cartesian-product-perl: generate the Cartesian product of zero or more lists
Math::
Cartesian: :Product generates the Cartesian product of zero or
more lists.
.
Given two lists, say: [a,b] and [1,2,3], the Cartesian product is the
set of all ordered pairs:
.
(a,1), (a,2), (a,3), (b,1), (b,2), (b,3)
.
which select their first element from all the possibilities listed in
the first list, and select their second element from all the
possibilities in the second list.
.
The idea can be generalized to n-tuples selected from n lists where all
the elements of the first list are combined with all the elements of
the second list, the results of which are then combined with all the
member of the third list and so on over all the input lists.
