[ Källkod: data-priority-map-clojure ]
Paket: libdata-priority-map-clojure (0.0.7-1)
Länkar för libdata-priority-map-clojure
Trisquelresurser:
Hämta källkodspaketet data-priority-map-clojure:
- [data-priority-map-clojure_0.0.7-1.dsc]
- [data-priority-map-clojure_0.0.7.orig.tar.gz]
- [data-priority-map-clojure_0.0.7-1.debian.tar.xz]
Ansvarig:
Original Maintainers:
- Debian Java Maintainers (E-postarkiv)
- Apollon Oikonomopoulos
Liknande paket:
priority maps for Clojure
data.priority-map implements priority maps in Clojure. A priority map is very similar to a sorted map, however its entries are sorted by value rather than by key.
In addition to supporting all the functions a sorted map supports, a priority map can also be thought of as a queue of [item priority] pairs. To support usage as a versatile priority queue, priority maps also support the conj/peek/pop operations
Andra paket besläktade med libdata-priority-map-clojure
|
|
|
-
- dep: libclojure-java
- Lisp dialect for the JVM (library)
Hämta libdata-priority-map-clojure
| Arkitektur | Paketstorlek | Installerad storlek | Filer |
|---|---|---|---|
| all | 16,6 kbyte | 51 kbyte | [filförteckning] |