oreodave/prick
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

prick_btree: add custom printing function for values

Browse Source 
Something you can feed in to the init function to be used by the
printer functions.
This commit is contained in:
Aryadev Chavali
2025-11-25 19:07:23 +00:00
parent 0278ee8599
commit 8783361010
1 changed files with 29 additions and 9 deletions
Download Patch File Download Diff File Expand all files Collapse all files

38
prick_btree.h
View File

@@ -27,6 +27,7 @@ typedef struct Prick_Bnode
typedef int (*prick_bnode_comp_fn)(void *, void *); typedef int (*prick_bnode_comp_fn)(void *, void *);
typedef prick_bnode_t *(*prick_bnode_alloc_fn)(); typedef prick_bnode_t *(*prick_bnode_alloc_fn)();
typedef void (*prick_bnode_free_fn)(prick_bnode_t *); typedef void (*prick_bnode_free_fn)(prick_bnode_t *);
typedef void (*prick_print_fn)(FILE *, void *);
typedef struct typedef struct
{ {
@@ -34,23 +35,28 @@ typedef struct
prick_bnode_comp_fn comp; prick_bnode_comp_fn comp;
prick_bnode_alloc_fn alloc; prick_bnode_alloc_fn alloc;
prick_bnode_free_fn free; prick_bnode_free_fn free;
prick_print_fn print;
} prick_btree_t; } prick_btree_t;
void prick_btree_init(prick_btree_t *tree, prick_bnode_comp_fn comparator, void prick_btree_init(prick_btree_t *tree, prick_bnode_comp_fn comparator,
prick_bnode_alloc_fn allocator, prick_bnode_free_fn free); prick_bnode_alloc_fn allocator, prick_bnode_free_fn free,
prick_print_fn print);
prick_bnode_t *prick_btree_insert(prick_btree_t *tree, void *value); prick_bnode_t *prick_btree_insert(prick_btree_t *tree, void *value);
void prick_btree_print(FILE *fp, prick_btree_t *tree);
void prick_btree_free(prick_btree_t *tree); void prick_btree_free(prick_btree_t *tree);
void prick_bnode_right_rotate(prick_bnode_t **node); void prick_bnode_right_rotate(prick_bnode_t **node);
void prick_bnode_left_rotate(prick_bnode_t **node); void prick_bnode_left_rotate(prick_bnode_t **node);
void prick_bnode_print(FILE *fp, prick_bnode_t *root); void prick_bnode_print(FILE *fp, prick_bnode_t *root, prick_print_fn print);
#ifdef PRICK_BTREE_IMPL #ifdef PRICK_BTREE_IMPL
#include <assert.h>
#include <stdlib.h> #include <stdlib.h>
void prick_btree_init(prick_btree_t *tree, prick_bnode_comp_fn comparator, void prick_btree_init(prick_btree_t *tree, prick_bnode_comp_fn comparator,
prick_bnode_alloc_fn allocator, prick_bnode_free_fn free) prick_bnode_alloc_fn allocator, prick_bnode_free_fn free,
prick_print_fn print)
{ {
if (tree) if (tree)
{ {
@@ -58,6 +64,7 @@ void prick_btree_init(prick_btree_t *tree, prick_bnode_comp_fn comparator,
tree->comp = comparator; tree->comp = comparator;
tree->alloc = allocator; tree->alloc = allocator;
tree->free = free; tree->free = free;
tree->print = print;
} }
} }
@@ -99,6 +106,18 @@ prick_bnode_t *prick_btree_insert(prick_btree_t *tree, void *value)
return tree->root; return tree->root;
} }
void prick_btree_print(FILE *fp, prick_btree_t *tree)
{
if (!tree->root)
{
fprintf(fp, "()");
}
else
{
prick_bnode_print(fp, tree->root, tree->print);
}
}
void prick_bnode_free(prick_bnode_t *bnode, prick_bnode_free_fn free_fn) void prick_bnode_free(prick_bnode_t *bnode, prick_bnode_free_fn free_fn)
{ {
if (!bnode) if (!bnode)
@@ -147,21 +166,22 @@ void prick_bnode_left_rotate(prick_bnode_t **node)
} }
} }
void prick_bnode_print(FILE *fp, prick_bnode_t *root) void prick_bnode_print(FILE *fp, prick_bnode_t *root, prick_print_fn print)
{ {
if (!root) if (!root)
return; return;
fprintf(fp, "(%p", root->value); fprintf(fp, "(");
print(fp, root->value);
if (root->left) if (root->left)
{ {
fprintf(fp, " "); fprintf(fp, " l");
prick_bnode_print(fp, root->left); prick_bnode_print(fp, root->left, print);
} }
if (root->right) if (root->right)
{ {
fprintf(fp, " "); fprintf(fp, " r");
prick_bnode_print(fp, root->right); prick_bnode_print(fp, root->right, print);
} }
fprintf(fp, ")"); fprintf(fp, ")");