libmath-cartesian-product-perl 1.009-1.1 source package in Ubuntu

Changelog

libmath-cartesian-product-perl (1.009-1.1) unstable; urgency=medium

  * Non maintainer upload by the Reproducible Builds team.
  * No source change upload to rebuild on buildd with .buildinfo files.

 -- Holger Levsen <email address hidden>  Wed, 06 Jan 2021 18:50:48 +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 Pocket Published Component Section
Jammy release universe misc

Builds

Hirsute: [FULLYBUILT] amd64

Downloads

File Size SHA-256 Checksum
libmath-cartesian-product-perl_1.009-1.1.dsc 2.2 KiB 9a953f0f1a200007514dc841525b7826482894b3bff3b8a226e058b83dae7415
libmath-cartesian-product-perl_1.009.orig.tar.gz 6.1 KiB d0bf24e56aaebe47c9db6d09c257bc3bf5af2d0d69f060fe33c180a9c7199f32
libmath-cartesian-product-perl_1.009-1.1.debian.tar.xz 3.3 KiB 0f5491a3eafbe8794e9b657c9e5bfa3d18c3eaa311f4f660e9fb6f5258200f69

Available diffs

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.