libcoveb-dev | high speed low memory footprint priority queue data structure lib | Mehr ...
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. .
libcoveb1 | range finding priority queue using optimized data structure | Mehr ...
Cache oblivious data structures have gained enormous popularity in theoretical computer science over recent decades. This package uses the van Emde Boas cache oblivious priority queue to provide high throughput unsigned integer priority queue and range finding operations ideally suited anywhere 32-bit discrete keys are utilized. .
libcoveb1-dbg | debugging coveb library for fast 32 bit priority queue operations | Mehr ...
Debug symbols included for this fast 32-bit mapping priority queue library.
libcoveb1-headers | cache oblivious van Emde Boas tree header files (coveb library) | Mehr ...
libcoveb is a library for storing a priority queue of 32-bit integers efficiently. It is faster than the STL, and provides O(log(log(n))) type performance for most operations. This means that, in practical terms, it does not exhibit much noticeable slowdown behavior as it scales from just a few entries all the way up to 2 or 4 billion entries in the queue. The data structure is a van Emde Boas stratified tree, and this has been theoretically shown to work well under any size cache. .
