libmath-cartesian-product-perl 1.008-2 source package in Ubuntu

Changelog

libmath-cartesian-product-perl (1.008-2) unstable; urgency=medium

  * Update copyright info:
    + Fix Upstream-refer.
    + Drop bogus alternative git URL.
    Thanks to Gregor Herrmann.

 -- Jonas Smedegaard <email address hidden>  Wed, 20 May 2015 17:16:43 +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 Pocket Published Component Section

Builds

Wily: [FULLYBUILT] amd64

Downloads

File Size SHA-256 Checksum
libmath-cartesian-product-perl_1.008-2.dsc 2.2 KiB 30cb5db96e39757b116bff597c3da4325c64b94bba34fe4cbd46f2b6b9bb22d0
libmath-cartesian-product-perl_1.008.orig.tar.gz 4.9 KiB 820b9162390f216f30e8c3b3bf55096e1a0d0dc53cabf1ffbbe43abd9ea41642
libmath-cartesian-product-perl_1.008-2.debian.tar.xz 2.9 KiB a942958f2de2ab76d046f3b3caaa47115f707768ae937e8ffb0330f3de4d5f6b

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.