wash/fx
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

meta: rename to fx

Browse Source
This commit is contained in:
max 🍓
2026-03-16 10:35:43 +00:00
parent 84df46489a
commit e9d0e323f0
233 changed files with 12875 additions and 12869 deletions
Download Patch File Download Diff File Expand all files Collapse all files

92
test/ds/trees.c
View File

@@ -1,68 +1,68 @@
#include <blue/core/btree.h>
#include <blue/core/iterator.h>
#include <blue/ds/dict.h>
#include <blue/ds/number.h>
#include <blue/ds/tree.h>
#include <fx/core/btree.h>
#include <fx/core/iterator.h>
#include <fx/ds/dict.h>
#include <fx/ds/number.h>
#include <fx/ds/tree.h>
#include <stdio.h>
#define NITEMS 16
struct tree_item {
int value;
b_tree_node node;
fx_tree_node node;
};
struct btree_item {
int value;
b_btree_node node;
fx_bst_node node;
};
B_BTREE_DEFINE_SIMPLE_GET(struct btree_item, int, node, value, get_node)
B_BTREE_DEFINE_SIMPLE_INSERT(struct btree_item, node, value, put_node)
FX_BTREE_DEFINE_SIMPLE_GET(struct btree_item, int, node, value, get_node)
FX_BTREE_DEFINE_SIMPLE_INSERT(struct btree_item, node, value, put_node)
int main(void)
{
b_dict *dict = b_dict_create();
b_dict_put(dict, "hello", B_RV_INT(32));
b_dict_put(dict, "world", B_RV_INT(64));
b_dict_put(dict, "more", B_RV_INT(128));
b_dict_put(dict, "other", B_RV_INT(256));
fx_dict *dict = fx_dict_create();
fx_dict_put(dict, "hello", FX_RV_INT(32));
fx_dict_put(dict, "world", FX_RV_INT(64));
fx_dict_put(dict, "more", FX_RV_INT(128));
fx_dict_put(dict, "other", FX_RV_INT(256));
b_iterator *it = b_iterator_begin(dict);
fx_iterator *it = fx_iterator_begin(dict);
size_t i = 0;
b_foreach(b_dict_item *, item, it)
fx_foreach(fx_dict_item *, item, it)
{
printf("item %zu: %s=%d\n", i++, b_string_ptr(item->key),
b_number_get_int(item->value));
printf("item %zu: %s=%d\n", i++, fx_string_ptr(item->key),
fx_number_get_int(item->value));
}
b_iterator_unref(it);
fx_iterator_unref(it);
b_tree *tree = b_tree_create();
fx_tree *tree = fx_tree_create();
struct tree_item items2[NITEMS];
for (int i = 0; i < NITEMS; i++) {
items2[i].value = i;
items2[i].node = B_TREE_NODE_INIT;
items2[i].node = FX_TREE_NODE_INIT;
}
b_tree_set_root(tree, &items2[0].node);
fx_tree_set_root(tree, &items2[0].node);
b_tree_node_add_child(&items2[0].node, &items2[1].node);
b_tree_node_add_child(&items2[0].node, &items2[2].node);
b_tree_node_add_child(&items2[0].node, &items2[3].node);
b_tree_node_add_child(&items2[0].node, &items2[7].node);
b_tree_node_add_child(&items2[1].node, &items2[4].node);
b_tree_node_add_child(&items2[1].node, &items2[5].node);
b_tree_node_add_child(&items2[4].node, &items2[6].node);
fx_tree_node_add_child(&items2[0].node, &items2[1].node);
fx_tree_node_add_child(&items2[0].node, &items2[2].node);
fx_tree_node_add_child(&items2[0].node, &items2[3].node);
fx_tree_node_add_child(&items2[0].node, &items2[7].node);
fx_tree_node_add_child(&items2[1].node, &items2[4].node);
fx_tree_node_add_child(&items2[1].node, &items2[5].node);
fx_tree_node_add_child(&items2[4].node, &items2[6].node);
#if 0
it = b_iterator_begin(tree);
b_tree_iterator it2;
b_tree_foreach(&it2, tree)
it = fx_iterator_begin(tree);
fx_tree_iterator it2;
fx_tree_foreach(&it2, tree)
{
struct tree_item *item = b_unbox(struct tree_item, it2.node, node);
struct tree_item *item = fx_unbox(struct tree_item, it2.node, node);
for (size_t i = 0; i < it2.depth; i++) {
fputs(" ", stdout);
@@ -71,7 +71,7 @@ int main(void)
printf("%u\n", item->value);
}
b_btree btree = {0};
fx_bst btree = {0};
struct btree_item items3[NITEMS] = {0};
for (int i = 0; i < NITEMS; i++) {
items3[i].value = i;
@@ -80,10 +80,10 @@ int main(void)
printf("\n\n");
b_btree_iterator it3;
b_btree_foreach (&it3, &btree) {
fx_bst_iterator it3;
fx_bst_foreach (&it3, &btree) {
struct btree_item *item
= b_unbox(struct btree_item, it3.node, node);
= fx_unbox(struct btree_item, it3.node, node);
for (size_t i = 0; i < it3.depth; i++) {
fputs(" ", stdout);
@@ -92,23 +92,23 @@ int main(void)
printf("%d\n", item->value);
}
b_btree_iterator_begin(&btree, &it3);
while (b_btree_iterator_is_valid(&it3)) {
fx_bst_iterator_begin(&btree, &it3);
while (fx_bst_iterator_is_valid(&it3)) {
struct btree_item *item
= b_unbox(struct btree_item, it3.node, node);
= fx_unbox(struct btree_item, it3.node, node);
if (item->value == 9) {
b_btree_iterator_erase(&it3);
fx_bst_iterator_erase(&it3);
} else {
b_btree_iterator_next(&it3);
fx_bst_iterator_next(&it3);
}
}
printf("\n\n");
b_btree_foreach (&it3, &btree) {
fx_bst_foreach (&it3, &btree) {
struct btree_item *item
= b_unbox(struct btree_item, it3.node, node);
= fx_unbox(struct btree_item, it3.node, node);
for (size_t i = 0; i < it3.depth; i++) {
fputs(" ", stdout);
@@ -117,9 +117,9 @@ int main(void)
printf("%d\n", item->value);
}
b_tree_unref(tree);
fx_tree_unref(tree);
#endif
b_dict_unref(dict);
fx_dict_unref(dict);
return 0;
}