high speed low memory footprint priority queue data structure lib
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.
coveb : An open source van Emde Boas Priority Queue library
by Rudi Cilibrasi (firstname.lastname@example.org)
The coveb package provides an easy to use library that allows efficient
priority queues on 32-bit unsigned integers.
Implements a time and space efficient priority queue on unsigned 32-bit
integers. Stores whether or not each integer is in the queue as a set of
integers, and allows efficient ra
Fri, 21 Mar 2008 15:23:19 -0700
First public release of the libcoveb stratified tree priority queue library.
libcoveb (1.0.4-1) unstable; urgency=low
* New upstream release.
* Added libcoveb1-dbg package.
-- Rudi Cilibrasi <email@example.com> Tue, 25 Mar 2008 14:14:58 -0700
libcoveb (1.0.3-1) unstable; urgency=low
* Initial release. van Emde Boas priority queue library.(Closes: #472099)
-- Rudi Cilibrasi <firstname.lastname@example.org> Fri, 21 Mar 2008 16:58:18 -0700
Rudi Cilibrasi (email@example.com)
libcoveb would not be possible without the following people's help:
Dr. Peter van Emde Boas and his
This package was debianized by Rudi Cilibrasi <firstname.lastname@example.org> on
Thu, 10 May 2007 10:16:32 +
Browse inside libcoveb-dev_1.0.4-1_amd64.deb
Results 1 - 1 of 1Search over 15 billion files
© 1997-2017 FileWatcher.com