[ Källkod: math-combinatorics-clojure ]
Paket: libmath-combinatorics-clojure (0.1.4-1)
Länkar för libmath-combinatorics-clojure
Trisquelresurser:
Hämta källkodspaketet math-combinatorics-clojure:
- [math-combinatorics-clojure_0.1.4-1.dsc]
- [math-combinatorics-clojure_0.1.4.orig.tar.xz]
- [math-combinatorics-clojure_0.1.4-1.debian.tar.xz]
Ansvarig:
Original Maintainers:
- Debian Java Maintainers (E-postarkiv)
- Apollon Oikonomopoulos
Liknande paket:
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.
Andra paket besläktade med libmath-combinatorics-clojure
|
|
|
-
- dep: libclojure-java
- Lisp dialect for the JVM (library)
Hämta libmath-combinatorics-clojure
| Arkitektur | Paketstorlek | Installerad storlek | Filer |
|---|---|---|---|
| all | 20,8 kbyte | 58 kbyte | [filförteckning] |