[ Källkod: haskell-psqueue ]
Paket: libghc-psqueue-doc (1.1-13build1)
Länkar för libghc-psqueue-doc
Trisquelresurser:
Hämta källkodspaketet haskell-psqueue:
- [haskell-psqueue_1.1-13build1.dsc]
- [haskell-psqueue_1.1.orig.tar.gz]
- [haskell-psqueue_1.1-13build1.debian.tar.xz]
Ansvarig:
Original Maintainers:
- Debian Haskell Group (E-postarkiv)
- Kiwamu Okabe
Externa resurser:
- Hemsida [hackage.haskell.org]
Liknande paket:
Priority Search Queue; documentation
A /priority search queue/ efficiently supports the opperations of both a search tree and a priority queue. A 'Binding' is a product of a key and a priority. Bindings can be inserted, deleted, modified and queried in logarithmic time, and the binding with the least priority can be retrieved in constant time. A queue can be built from a list of bindings, sorted by keys, in linear time.
This package contains the documentation files.
Andra paket besläktade med libghc-psqueue-doc
|
|
|
-
- dep: haddock-interface-33
- virtuellt paket som tillhandahålls av ghc
-
- rec: ghc-doc
- Documentation for the Glasgow Haskell Compilation system
-
- rec: libjs-mathjax
- JavaScript display engine for LaTeX and MathML
Hämta libghc-psqueue-doc
| Arkitektur | Paketstorlek | Installerad storlek | Filer |
|---|---|---|---|
| all | 42,5 kbyte | 495 kbyte | [filförteckning] |