Mineplay/Fledasty
1
0
Fork 0
Code Issues 5 Pull requests 1 Projects 1 Releases Packages Wiki Activity Actions

feat(search tree): added utility functions to search tree

Browse source
This commit is contained in:
Mineplay 2025-08-31 10:46:08 -05:00
parent 1d8550d653
commit dab5f6a9b2
2 changed files with 48 additions and 20 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

64
Include/Fledasty/Trees/BinarySearchTree.h
View file

@ -33,26 +33,29 @@
#include "../Utils/Error.h" #include "../Utils/Error.h"
#define FLEDASTY_BINARY_SEARCH_TREE_DEFINE(key_type, value_type, name) \ #define FLEDASTY_BINARY_SEARCH_TREE_DEFINE(key_type, value_type, name) \
typedef struct FledastyBinarySearchTreeNode_##name { \ typedef struct FledastyBinarySearchTreeNode_##name { \
key_type key; \ key_type key; \
value_type value; \ value_type value; \
\ \
struct FledastyBinarySearchTreeNode_##name *parent, *left, *right; \ struct FledastyBinarySearchTreeNode_##name *parent, *left, *right; \
} FledastyBinarySearchTreeNode_##name; \ } FledastyBinarySearchTreeNode_##name; \
\ \
typedef struct { \ typedef struct { \
size_t size, depth; \ size_t size, depth; \
FledastyBinarySearchTreeNode_##name *top; \ FledastyBinarySearchTreeNode_##name *top; \
} FledastyBinarySearchTree_##name; \ } FledastyBinarySearchTree_##name; \
\ \
FledastyError fledasty_binary_search_tree_##name##_free(FledastyBinarySearchTree_##name *current_binary_search_tree); \ FledastyError fledasty_binary_search_tree_##name##_free(FledastyBinarySearchTree_##name *current_binary_search_tree); \
\ \
FledastyError fledasty_binary_search_tree_##name##_insert(FledastyBinarySearchTree_##name *current_binary_search_tree, key_type key, value_type value); \ FledastyError fledasty_binary_search_tree_##name##_insert(FledastyBinarySearchTree_##name *current_binary_search_tree, key_type key, value_type value); \
FledastyError fledasty_binary_search_tree_##name##_get(FledastyBinarySearchTree_##name *current_binary_search_tree, key_type key, value_type *out); \ FledastyError fledasty_binary_search_tree_##name##_get(FledastyBinarySearchTree_##name *current_binary_search_tree, key_type key, value_type *out); \
FledastyError fledasty_binary_search_tree_##name##_remove(FledastyBinarySearchTree_##name *current_binary_search_tree, key_type key); \ FledastyError fledasty_binary_search_tree_##name##_remove(FledastyBinarySearchTree_##name *current_binary_search_tree, key_type key); \
\ \
FledastyError fledasty_binary_search_tree_##name##_in_order_traversal(FledastyBinarySearchTree_##name *current_binary_search_tree, FledastyBinarySearchTreeNode_##name ***out); FledastyError fledasty_binary_search_tree_##name##_in_order_traversal(FledastyBinarySearchTree_##name *current_binary_search_tree, FledastyBinarySearchTreeNode_##name ***out); \
\
bool fledasty_binary_search_tree_##name##_has_key(const FledastyBinarySearchTree_##name *current_binary_search_tree, key_type key); \
static inline bool fledasty_binary_search_tree_##name##_is_empty(const FledastyBinarySearchTree_##name *current_binary_search_tree) { return current_binary_search_tree == NULL || current_binary_search_tree->size == 0; }
#define FLEDASTY_BINARY_SEARCH_TREE_IMPLEMENT(key_type, value_type, name, compare_key_function, key_less_than_function) \ #define FLEDASTY_BINARY_SEARCH_TREE_IMPLEMENT(key_type, value_type, name, compare_key_function, key_less_than_function) \
FledastyError fledasty_binary_search_tree_##name##_free(FledastyBinarySearchTree_##name *current_binary_search_tree) { \ FledastyError fledasty_binary_search_tree_##name##_free(FledastyBinarySearchTree_##name *current_binary_search_tree) { \
@ -262,6 +265,27 @@ FledastyError fledasty_binary_search_tree_##name##_in_order_traversal(FledastyBi
} \ } \
\ \
return FLEDASTY_ERROR_NONE; \ return FLEDASTY_ERROR_NONE; \
} \
\
bool fledasty_binary_search_tree_##name##_has_key(const FledastyBinarySearchTree_##name *current_binary_search_tree, key_type key) { \
if (current_binary_search_tree == NULL) { \
return false; \
} \
\
FledastyBinarySearchTreeNode_##name *current_node = current_binary_search_tree->top; \
while (current_node != NULL) { \
if (compare_key_function(current_node->key, key)) { \
return true; \
} \
\
if (key_less_than_function(key, current_node->key)) { \
current_node = current_node->left; \
} else { \
current_node = current_node->right; \
} \
} \
\
return false; \
} }
#endif #endif

4
Tests/Main.c
View file

@ -351,6 +351,10 @@ int main() {
fledasty_binary_search_tree_int_int_get(&test_search_tree, 7, &get_out); fledasty_binary_search_tree_int_int_get(&test_search_tree, 7, &get_out);
printf("Search tree get result: %d\n", get_out); printf("Search tree get result: %d\n", get_out);
if (fledasty_binary_search_tree_int_int_has_key(&test_search_tree, 10)) {
printf("Search tree has key: 10\n");
}
fledasty_binary_search_tree_int_int_free(&test_search_tree); fledasty_binary_search_tree_int_int_free(&test_search_tree);
printf("Done\n"); printf("Done\n");
return 0; return 0;