Пакет: libghc-psqueue-doc (1.1-13)

[ Источник: haskell-psqueue  ]

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.

Другие пакеты, относящиеся к libghc-psqueue-doc

• dep: haddock-interface-33

  виртуальный пакет, предоставляемый ghc

• rec: ghc-doc

  Documentation for the Glasgow Haskell Compilation system

• rec: libjs-mathjax

  JavaScript display engine for LaTeX and MathML

Загрузка libghc-psqueue-doc

Загрузить для всех доступных архитектур

Архитектура	Размер пакета	В установленном виде	Файлы
all	53,9 Кб	479,0 Кб	[список файлов]