[ Source: math-combinatorics-clojure ]
Paketti: libmath-combinatorics-clojure (0.1.4-1.1)
Links for libmath-combinatorics-clojure
Debian-palvelut:
Imuroi lähdekoodipaketti math-combinatorics-clojure:
- [math-combinatorics-clojure_0.1.4-1.1.dsc]
- [math-combinatorics-clojure_0.1.4.orig.tar.xz]
- [math-combinatorics-clojure_0.1.4-1.1.debian.tar.xz]
Ylläpitäjät:
- Debian Java Maintainers (Laadunvalvontasivu, Mail Archive)
- Apollon Oikonomopoulos (Laadunvalvontasivu)
Samankaltaisia paketteja:
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.
Muut pakettiin libmath-combinatorics-clojure liittyvät paketit
|
|
|
|
-
- dep: libclojure-java
- Lisp dialect for the JVM (library)
Imuroi libmath-combinatorics-clojure
| Arkkitehtuuri | Paketin koko | Koko asennettuna | Tiedostot |
|---|---|---|---|
| all | 21.0 kt | 58.0 kt | [tiedostoluettelo] |