| Paketname | libcoveb-dev |
| Beschreibung | high speed low memory footprint priority queue data structure lib |
| Archiv/Repository | Offizielles Debian Archiv squeeze (main) |
| Version | 1.0.4-1 |
| Sektion | libdevel |
| Priorität | optional |
| Installierte Größe | 408 Byte |
| Hängt ab von | libcoveb1, libcoveb1-headers, libgsl0-dev, pkg-config |
| Empfohlene Pakete | |
| Paketbetreuer | Rudi Cilibrasi |
| Quelle | libcoveb |
| Paketgröße | 73746 Byte |
| Prüfsumme MD5 | 4c89b47909c2246d7aba11745de3cb70 |
| Prüfsumme SHA1 | b210ba58f83836343f212e523f721d5214224177 |
| Prüfsumme SHA256 | 15df429ba0c83f7c1d72601509cd649f8e06b09fc75ea0cf3beb49937b80015a |
| Link zum Herunterladen | libcoveb-dev_1.0.4-1_i386.deb |
| Ausführliche Beschreibung | In networking, computer graphics, and many other applications it is
necessary to have a high-throughput priority queue. libcoveb provides
this by using a powerful data structure called stratified trees. By
using special indexing techniques, they are able to provide access to more
data in less time than more common balanced binary trees. This priority
queue supports range and greater-than type queries as well as basic
set containment. It is an ideal choice for keeping a sorted list of integers
available from a large unsorted dynamic list of data. There is also a
customizable mapping priority queue that can carry any kind of user data.
.
|