libmath-cartesian-product-perl 1.009-2 source package in Ubuntu
Changelog
libmath-cartesian-product-perl (1.009-2) unstable; urgency=medium [ Salvatore Bonaccorso ] * Update Vcs-* headers for switch to salsa.debian.org [ gregor herrmann ] * debian/*: update URLs from {search,www}.cpan.org to MetaCPAN. [ Debian Janitor ] * Use secure copyright file specification URI. * Bump debhelper dependency to >= 9, since that's what is used in debian/compat. * Bump debhelper from old 9 to 10. * Set Testsuite header for perl package. * Update renamed lintian tag names in lintian overrides. -- Jelmer Vernooij <email address hidden> Wed, 15 Jun 2022 18:56:22 +0100
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 |
---|
Downloads
File | Size | SHA-256 Checksum |
---|---|---|
libmath-cartesian-product-perl_1.009-2.dsc | 2.2 KiB | b69d0c459ce2c438dfbbcdccd98cb89a655240555c6c8b0da5c887018fb19947 |
libmath-cartesian-product-perl_1.009.orig.tar.gz | 6.1 KiB | d0bf24e56aaebe47c9db6d09c257bc3bf5af2d0d69f060fe33c180a9c7199f32 |
libmath-cartesian-product-perl_1.009-2.debian.tar.xz | 3.6 KiB | 5f139bfdb67b2fcebea828c29271c9b8fc35281c3bfbefd23722a3cdba0ffd74 |
Available diffs
- diff from 1.009-1.1 to 1.009-2 (1.5 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.