Man Linux: Main Page and Category List

coveb - cache oblivious high speed 32-bit priority queue for large data sets

coveb:library for space and time efficient manipulation of unsigned 32-bit integers.

pleaseseecoveb-tree.hortheincludedREADMEfordetails.#include<coveb.h>Instantiation:structcoveb_bq*q;q=coveb_bq_new();This allocates a new cache-oblivious bitwise priority queue. To free, use:Deallocation:coveb_bq_free(q);Insertionof32-bitunsignedintegervalues:voidcoveb_bq_insert(structcoveb_bq*q,uint32_tx);places a new value into the queue, or does nothing if it’s already there.Removalofvalues:uint32_tcoveb_bq_extractmin(structcoveb_bq*q);removes the smallest value (min) from the queue and returns it. It is illegal to try to remove a value from an empty (size = 0) queue. This is the fastest way to remove elements.uint32_tcoveb_bq_remove(structcoveb_bq*q,uint32_tx);This generic function removes any specific value from the queue. It returns 0 if the object was already in the queue, and 1 if not. Queue status monitoring: When the queue is completely full (containing four ’binary’ gigasamples), it consumes about one gigabyte of memory. This means that it uses about 2 bits per sample on average when full. This is only about twice as big as the literal storage cost of a typical queue state. Because this size is not reportable as a 32-bit integer, the following function is available to detect the full queue condition:uint32_tcoveb_bq_addresses_full(conststructcoveb_bq*q);Returns 1 if all 2 ** 32 elements are in the queue, or 0 otherwise. When the queue is not full, the normal size function is exactly accurate:uint32_tcoveb_bq_size(conststructcoveb_bq*q);returns the count of integers currently stored in the queue. This can be used to see if an element can be extracted safely (size > 0). Note that in the special case where the queue is completely full and therefore the number of elements in the queue is one greater than the maximum value of an unsigned 32-bit integer, the size function will return instead one less than the actual number of elements. To detect this uncommon condition use coveb_bq_addresses_full.Extremafunctionsuint32_tcoveb_bq_max(conststructcoveb_bq*q);returns the largest integer stored in the queue without removal.uint32_tcoveb_bq_min(conststructcoveb_bq*q);returns the smallest integer stored in the queue without removal.Rangefindingfunctionsvoidcoveb_bq_locate_smallest_not_less_than(conststructcoveb_bq*q,uint32_tincl_lower_bound,uint32_t*result_x,uint32_t*gotresult);searches for an integer stored in the queue that is not less than incl_lower_bound. If there is more than one such integer, the smallest is returned. If an integer is found, *gotresult will be set to 1 and *result_x will hold the integer that was found. If no such integer is found in the queue, then *gotresult with be set to 0 and *result_x will be untouched. The queue is not modified in any case.voidcoveb_bq_successor(conststructcoveb_bq*q,uint32_texcl_lower_bound,uint32_t*result_x,uint32_t*gotresult);This function scans upward for an integer that is greater than excl_lower_bound. It is otherwise the same as the coveb_bq_locate_smallest_not_less_than function. This library uses a data structure inspired by Peter van Emde Boas.ENVIRONMENTnone

The failout(msg) macro may be redefined using #define FAILOUT_FUNC(msg)