Container classes for GNUnet. More...
Go to the source code of this file.
Macros | |
| #define | GNUNET_CONTAINER_LIB_H |
| #define | GNUNET_CONTAINER_DLL_insert(head, tail, element) |
| Insert an element at the head of a DLL. | |
| #define | GNUNET_CONTAINER_DLL_insert_tail(head, tail, element) |
| Insert an element at the tail of a DLL. | |
| #define | GNUNET_CONTAINER_DLL_insert_after(head, tail, other, element) |
| Insert an element into a DLL after the given other element. | |
| #define | GNUNET_CONTAINER_DLL_insert_before(head, tail, other, element) |
| Insert an element into a DLL before the given other element. | |
| #define | GNUNET_CONTAINER_DLL_remove(head, tail, element) |
| Remove an element from a DLL. | |
| #define | GNUNET_CONTAINER_MDLL_insert(mdll, head, tail, element) |
| Insert an element at the head of a MDLL. | |
| #define | GNUNET_CONTAINER_MDLL_insert_tail(mdll, head, tail, element) |
| Insert an element at the tail of a MDLL. | |
| #define | GNUNET_CONTAINER_MDLL_insert_after(mdll, head, tail, other, element) |
| Insert an element into a MDLL after the given other element. | |
| #define | GNUNET_CONTAINER_MDLL_insert_before(mdll, head, tail, other, element) |
| Insert an element into a MDLL before the given other element. | |
| #define | GNUNET_CONTAINER_MDLL_remove(mdll, head, tail, element) |
| Remove an element from a MDLL. | |
| #define | GNUNET_CONTAINER_DLL_insert_sorted(TYPE, comparator, comparator_cls, head, tail, element) |
| Insertion sort of element into DLL from head to tail sorted by comparator. | |
Typedefs | |
| typedef int(* | GNUNET_CONTAINER_HashCodeIterator) (void *cls, struct GNUNET_HashCode *next) |
Iterator over struct GNUNET_HashCode. | |
| typedef uint64_t | GNUNET_CONTAINER_HeapCostType |
| Cost by which elements in a heap can be ordered. | |
| typedef enum GNUNET_GenericReturnValue(* | GNUNET_CONTAINER_HeapIterator) (void *cls, struct GNUNET_CONTAINER_HeapNode *node, void *element, GNUNET_CONTAINER_HeapCostType cost) |
| Iterator for heap. | |
Enumerations | |
| enum | GNUNET_CONTAINER_HeapOrder { GNUNET_CONTAINER_HEAP_ORDER_MAX , GNUNET_CONTAINER_HEAP_ORDER_MIN } |
| Heap type, either max or min. More... | |
Functions | |
| int | GNUNET_try_compression (const char *data, size_t old_size, char **result, size_t *new_size) |
| Try to compress the given block of data using libz. | |
| char * | GNUNET_decompress (const char *input, size_t input_size, size_t output_size) |
| Decompress input, return the decompressed data as output. | |
| struct GNUNET_CONTAINER_BloomFilter * | GNUNET_CONTAINER_bloomfilter_load (const char *filename, size_t size, unsigned int k) |
| Load a Bloom filter from a file. | |
| struct GNUNET_CONTAINER_BloomFilter * | GNUNET_CONTAINER_bloomfilter_init (const char *data, size_t size, unsigned int k) |
| Create a Bloom filter from raw bits. | |
| enum GNUNET_GenericReturnValue | GNUNET_CONTAINER_bloomfilter_get_raw_data (const struct GNUNET_CONTAINER_BloomFilter *bf, char *data, size_t size) |
| Copy the raw data of this Bloom filter into the given data array. | |
| bool | GNUNET_CONTAINER_bloomfilter_test (const struct GNUNET_CONTAINER_BloomFilter *bf, const struct GNUNET_HashCode *e) |
| Test if an element is in the filter. | |
| void | GNUNET_CONTAINER_bloomfilter_add (struct GNUNET_CONTAINER_BloomFilter *bf, const struct GNUNET_HashCode *e) |
| Add an element to the filter. | |
| void | GNUNET_CONTAINER_bloomfilter_remove (struct GNUNET_CONTAINER_BloomFilter *bf, const struct GNUNET_HashCode *e) |
| Remove an element from the filter. | |
| struct GNUNET_CONTAINER_BloomFilter * | GNUNET_CONTAINER_bloomfilter_copy (const struct GNUNET_CONTAINER_BloomFilter *bf) |
| Create a copy of a bloomfilter. | |
| void | GNUNET_CONTAINER_bloomfilter_free (struct GNUNET_CONTAINER_BloomFilter *bf) |
| Free the space associated with a filter in memory, flush to drive if needed (do not free the space on the drive). | |
| size_t | GNUNET_CONTAINER_bloomfilter_get_element_addresses (const struct GNUNET_CONTAINER_BloomFilter *bf) |
| Get the number of the addresses set per element in the bloom filter. | |
| size_t | GNUNET_CONTAINER_bloomfilter_get_size (const struct GNUNET_CONTAINER_BloomFilter *bf) |
| Get size of the bloom filter. | |
| void | GNUNET_CONTAINER_bloomfilter_clear (struct GNUNET_CONTAINER_BloomFilter *bf) |
| Reset a Bloom filter to empty. | |
| enum GNUNET_GenericReturnValue | GNUNET_CONTAINER_bloomfilter_or (struct GNUNET_CONTAINER_BloomFilter *bf, const char *data, size_t size) |
| "or" the entries of the given raw data array with the data of the given Bloom filter. | |
| enum GNUNET_GenericReturnValue | GNUNET_CONTAINER_bloomfilter_or2 (struct GNUNET_CONTAINER_BloomFilter *bf, const struct GNUNET_CONTAINER_BloomFilter *to_or) |
| "or" the entries of the given raw data array with the data of the given Bloom filter. | |
| void | GNUNET_CONTAINER_bloomfilter_resize (struct GNUNET_CONTAINER_BloomFilter *bf, GNUNET_CONTAINER_HashCodeIterator iterator, void *iterator_cls, size_t size, unsigned int k) |
| Resize a bloom filter. | |
| struct GNUNET_CONTAINER_Heap * | GNUNET_CONTAINER_heap_create (enum GNUNET_CONTAINER_HeapOrder order) |
| Create a new heap. | |
| void | GNUNET_CONTAINER_heap_destroy (struct GNUNET_CONTAINER_Heap *heap) |
| Destroys the heap. | |
| void * | GNUNET_CONTAINER_heap_peek (const struct GNUNET_CONTAINER_Heap *heap) |
| Get element stored at the root of heap. | |
| enum GNUNET_GenericReturnValue | GNUNET_CONTAINER_heap_peek2 (const struct GNUNET_CONTAINER_Heap *heap, void **element, GNUNET_CONTAINER_HeapCostType *cost) |
| Get element and cost stored at the root of heap. | |
| unsigned int | GNUNET_CONTAINER_heap_get_size (const struct GNUNET_CONTAINER_Heap *heap) |
| Get the current size of the heap. | |
| GNUNET_CONTAINER_HeapCostType | GNUNET_CONTAINER_heap_node_get_cost (const struct GNUNET_CONTAINER_HeapNode *node) |
| Get the current cost of the node. | |
| void | GNUNET_CONTAINER_heap_iterate (const struct GNUNET_CONTAINER_Heap *heap, GNUNET_CONTAINER_HeapIterator iterator, void *iterator_cls) |
| Iterate over all entries in the heap, in no particular order. | |
| void * | GNUNET_CONTAINER_heap_walk_get_next (struct GNUNET_CONTAINER_Heap *heap) |
| Perform a random walk of the tree. | |
| struct GNUNET_CONTAINER_HeapNode * | GNUNET_CONTAINER_heap_insert (struct GNUNET_CONTAINER_Heap *heap, void *element, GNUNET_CONTAINER_HeapCostType cost) |
| Inserts a new element into the heap. | |
| void * | GNUNET_CONTAINER_heap_remove_root (struct GNUNET_CONTAINER_Heap *heap) |
| Remove root of the heap. | |
| void * | GNUNET_CONTAINER_heap_remove_node (struct GNUNET_CONTAINER_HeapNode *node) |
| Removes a node from the heap. | |
| void | GNUNET_CONTAINER_heap_update_cost (struct GNUNET_CONTAINER_HeapNode *node, GNUNET_CONTAINER_HeapCostType new_cost) |
| Updates the cost of any node in the tree. | |
Container classes for GNUnet.
Definition in file gnunet_container_lib.h.