1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
|
Source: math-combinatorics-clojure
Section: java
Priority: optional
Maintainer: Debian Java Maintainers <pkg-java-maintainers@lists.alioth.debian.org>
Uploaders: Apollon Oikonomopoulos <apoikos@debian.org>
Build-Depends: clojure (>= 1.8),
debhelper (>= 10),
default-jdk,
javahelper (>= 0.32),
markdown,
maven-repo-helper (>= 1.5~)
Standards-Version: 4.0.0
Package: libmath-combinatorics-clojure
Architecture: all
Depends: ${java:Depends}, ${misc:Depends}
Recommends: ${java:Recommends}
Description: 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.
|
