GreekStapler/libvieter
1
0
Fork 0
forked from vieter-v/libvieter
Code Issues Pull requests Releases Activity

test(heap): add random test that exposes some faults

Browse source
This commit is contained in:
Jef Roosens 2023-01-24 21:19:08 +01:00
parent 6845e67cb6
commit 63100c5b99
Signed by: Jef Roosens
GPG key ID: B75D4F293C7052DB
2 changed files with 70 additions and 5 deletions
Download patch file Download diff file Expand all files Collapse all files

27
src/heap/vieter_heap_tree.h
View file

@ -9,28 +9,45 @@ typedef struct vieter_heap_node {
void *data;
struct vieter_heap_node *largest_order;
union {
struct vieter_heap_node *next_tree;
struct vieter_heap_node *next_largest_order;
// Roots point to next tree in the heap, other nodes point to their first
// neighbour.
struct vieter_heap_node *next_tree;
struct vieter_heap_node *next_largest_order;
} ptr;
uint8_t order;
} vieter_heap_node;
/*
* Allocate an initialize a heap node object.
*/
vieter_heap_node *vieter_heap_node_init();
/*
* Deallocate a node object.
*/
void vieter_heap_node_free(vieter_heap_node *node);
/* vieter_heap_tree *vieter_heap_tree_init(vieter_heap_node *root, vieter_heap_tree *next, uint8_t order); */
/*
* Deallocate a tree object, along with its underlying tree structure.
* Deallocate a node's entire structure.
*/
void vieter_heap_tree_free(vieter_heap_node *root);
/*
* Given the roots of the smallest trees in two heaps, merge them into a single
* large heap.
*/
vieter_heap_node *vieter_heap_tree_merge(vieter_heap_node *root_a, vieter_heap_node *root_b);
/*
* Given the roots of two trees of the same order, merge them into a heap of one
* order larger.
*/
vieter_heap_node *vieter_heap_tree_merge_same_order(vieter_heap_node *root_a,
vieter_heap_node *root_b);
/*
* Remove the smallest element from the given heap.
*/
vieter_heap_node *vieter_heap_tree_pop(void **out, vieter_heap_node *root);
#endif