math-combinatorics-clojure 0.1.4-1.1 source package in Ubuntu
Changelog
math-combinatorics-clojure (0.1.4-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 19:29:07 +0100
Upload details
- Uploaded by:
- Debian Java Maintainers
- Uploaded to:
- Sid
- Original maintainer:
- Debian Java Maintainers
- Architectures:
- all
- Section:
- misc
- Urgency:
- Medium Urgency
See full publishing history Publishing
Series | Published | Component | Section | |
---|---|---|---|---|
Noble | release | universe | misc | |
Mantic | release | universe | misc | |
Lunar | release | universe | misc | |
Jammy | release | universe | misc |
Downloads
File | Size | SHA-256 Checksum |
---|---|---|
math-combinatorics-clojure_0.1.4-1.1.dsc | 2.0 KiB | 4884e9d6883020d1902d999e87aa099bb78820cadfdda1c797c34d639ed2216f |
math-combinatorics-clojure_0.1.4.orig.tar.xz | 16.4 KiB | 5cca257aed9a9353343af6d670d0c034b0c6686b0c5f794ed21da6d71f7a14e8 |
math-combinatorics-clojure_0.1.4-1.1.debian.tar.xz | 6.6 KiB | 6a52230f370d49d84f4edca0ad9315d907ca221de3ed66ffdd31345c80088d67 |
Available diffs
- diff from 0.1.4-1 to 0.1.4-1.1 (398 bytes)
No changes file available.
Binary packages built by this source
- libmath-combinatorics-clojure: generate lazy sequences for common combinatorial functions in Clojure
math.combinatorics is a collection of efficient functional algorithms for
generating lazy sequences for common combinatorial functions, like partitions,
selections, cartesian products, etc. It is implemented in pure Clojure.