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

220
ds/tree.c
View File

@@ -1,4 +1,4 @@
#include <blue/ds/tree.h>
#include <fx/ds/tree.h>
#include <stdlib.h>
#include <string.h>
@@ -14,26 +14,26 @@
/*** PRIVATE DATA *************************************************************/
struct b_tree_p {
struct b_tree_node *t_root;
struct fx_tree_p {
struct fx_tree_node *t_root;
};
struct b_tree_iterator_p {
struct fx_tree_iterator_p {
size_t i, depth;
b_tree_node *node;
fx_tree_node *node;
unsigned char _f01;
};
/*** PRIVATE FUNCTIONS ********************************************************/
static void tree_set_root(struct b_tree_p *tree, struct b_tree_node *node)
static void tree_set_root(struct fx_tree_p *tree, struct fx_tree_node *node)
{
tree->t_root = node;
}
static const struct b_tree_node *next_node(
const struct b_tree_node *node, bool recursive, int *depth_diff)
static const struct fx_tree_node *next_node(
const struct fx_tree_node *node, bool recursive, int *depth_diff)
{
if (!node) {
return NULL;
@@ -45,14 +45,14 @@ static const struct b_tree_node *next_node(
}
int d = 0;
struct b_tree_node *next = NODE_FIRST_CHILD(node);
struct fx_tree_node *next = NODE_FIRST_CHILD(node);
if (next) {
d = 1;
*depth_diff = d;
return next;
}
const struct b_tree_node *n = node;
const struct fx_tree_node *n = node;
next = NODE_NEXT_SIBLING(n);
while (!next) {
n = NODE_PARENT(n);
@@ -68,14 +68,14 @@ static const struct b_tree_node *next_node(
return next;
}
static void remove_node(struct b_tree_node *node)
static void remove_node(struct fx_tree_node *node)
{
struct b_tree_node *parent = NODE_PARENT(node);
struct fx_tree_node *parent = NODE_PARENT(node);
if (!parent) {
return;
}
struct b_tree_node *n0 = NULL, *n1 = NULL;
struct fx_tree_node *n0 = NULL, *n1 = NULL;
n0 = NODE_FIRST_CHILD(parent);
while (n0) {
@@ -101,16 +101,16 @@ static void remove_node(struct b_tree_node *node)
}
static void reparent_children(
struct b_tree_node *old_parent, struct b_tree_node *new_parent)
struct fx_tree_node *old_parent, struct fx_tree_node *new_parent)
{
struct b_tree_node *last = NODE_FIRST_CHILD(new_parent);
struct fx_tree_node *last = NODE_FIRST_CHILD(new_parent);
while (last && NODE_NEXT_SIBLING(last)) {
last = NODE_NEXT_SIBLING(last);
}
struct b_tree_node *cur = NODE_FIRST_CHILD(old_parent);
struct fx_tree_node *cur = NODE_FIRST_CHILD(old_parent);
while (cur) {
struct b_tree_node *next = NODE_NEXT_SIBLING(cur);
struct fx_tree_node *next = NODE_NEXT_SIBLING(cur);
NODE_PARENT(cur) = new_parent;
NODE_NEXT_SIBLING(cur) = NULL;
@@ -127,12 +127,12 @@ static void reparent_children(
/*** PUBLIC FUNCTIONS *********************************************************/
void b_tree_set_root(b_tree *tree, struct b_tree_node *node)
void fx_tree_set_root(fx_tree *tree, struct fx_tree_node *node)
{
B_CLASS_DISPATCH_STATIC(B_TYPE_TREE, tree_set_root, tree, node);
FX_CLASS_DISPATCH_STATIC(FX_TYPE_TREE, tree_set_root, tree, node);
}
void b_tree_node_add_child(struct b_tree_node *parent, struct b_tree_node *child)
void fx_tree_node_add_child(struct fx_tree_node *parent, struct fx_tree_node *child)
{
if (NODE_PARENT(child)) {
return;
@@ -144,7 +144,7 @@ void b_tree_node_add_child(struct b_tree_node *parent, struct b_tree_node *child
return;
}
struct b_tree_node *cur = NODE_FIRST_CHILD(parent);
struct fx_tree_node *cur = NODE_FIRST_CHILD(parent);
while (NODE_NEXT_SIBLING(cur)) {
cur = NODE_NEXT_SIBLING(cur);
}
@@ -152,19 +152,19 @@ void b_tree_node_add_child(struct b_tree_node *parent, struct b_tree_node *child
NODE_NEXT_SIBLING(cur) = child;
}
void b_tree_node_add_sibling(struct b_tree_node *node, struct b_tree_node *to_add)
void fx_tree_node_add_sibling(struct fx_tree_node *node, struct fx_tree_node *to_add)
{
if (NODE_PARENT(to_add) || !NODE_PARENT(node)) {
return;
}
b_tree_node_add_child(NODE_PARENT(node), to_add);
fx_tree_node_add_child(NODE_PARENT(node), to_add);
}
struct b_tree_node *b_tree_node_get_child(struct b_tree_node *node, size_t at)
struct fx_tree_node *fx_tree_node_get_child(struct fx_tree_node *node, size_t at)
{
size_t i = 0;
struct b_tree_node *cur = NODE_FIRST_CHILD(node);
struct fx_tree_node *cur = NODE_FIRST_CHILD(node);
while (i < at) {
if (!cur) {
@@ -178,23 +178,23 @@ struct b_tree_node *b_tree_node_get_child(struct b_tree_node *node, size_t at)
return cur;
}
b_iterator *b_tree_begin(b_tree *tree)
fx_iterator *fx_tree_begin(fx_tree *tree)
{
struct b_tree_p *p = b_object_get_private(tree, B_TYPE_TREE);
return b_tree_node_begin(p->t_root);
struct fx_tree_p *p = fx_object_get_private(tree, FX_TYPE_TREE);
return fx_tree_node_begin(p->t_root);
}
const b_iterator *b_tree_cbegin(const b_tree *tree)
const fx_iterator *fx_tree_cbegin(const fx_tree *tree)
{
struct b_tree_p *p = b_object_get_private(tree, B_TYPE_TREE);
return b_tree_node_begin(p->t_root);
struct fx_tree_p *p = fx_object_get_private(tree, FX_TYPE_TREE);
return fx_tree_node_begin(p->t_root);
}
b_iterator *b_tree_node_begin(struct b_tree_node *node)
fx_iterator *fx_tree_node_begin(struct fx_tree_node *node)
{
b_tree_iterator *it_obj = b_object_create(B_TYPE_TREE_ITERATOR);
struct b_tree_iterator_p *it
= b_object_get_private(it_obj, B_TYPE_TREE_ITERATOR);
fx_tree_iterator *it_obj = fx_object_create(FX_TYPE_TREE_ITERATOR);
struct fx_tree_iterator_p *it
= fx_object_get_private(it_obj, FX_TYPE_TREE_ITERATOR);
it->node = NODE_FIRST_CHILD(node);
it->i = 0;
@@ -203,22 +203,22 @@ b_iterator *b_tree_node_begin(struct b_tree_node *node)
ITERATOR_UNSET_RECURSIVE(it);
if (!it->node) {
b_iterator_set_status(it_obj, B_ERR_NO_DATA);
fx_iterator_set_status(it_obj, FX_ERR_NO_DATA);
}
return it_obj;
}
const b_iterator *b_tree_node_cbegin(const struct b_tree_node *node)
const fx_iterator *fx_tree_node_cbegin(const struct fx_tree_node *node)
{
return b_tree_node_begin((struct b_tree_node *)node);
return fx_tree_node_begin((struct fx_tree_node *)node);
}
b_iterator *b_tree_node_begin_recursive(struct b_tree_node *node)
fx_iterator *fx_tree_node_begin_recursive(struct fx_tree_node *node)
{
b_tree_iterator *it_obj = b_object_create(B_TYPE_TREE_ITERATOR);
struct b_tree_iterator_p *it
= b_object_get_private(it_obj, B_TYPE_TREE_ITERATOR);
fx_tree_iterator *it_obj = fx_object_create(FX_TYPE_TREE_ITERATOR);
struct fx_tree_iterator_p *it
= fx_object_get_private(it_obj, FX_TYPE_TREE_ITERATOR);
it->node = node;
it->i = 0;
@@ -227,38 +227,38 @@ b_iterator *b_tree_node_begin_recursive(struct b_tree_node *node)
ITERATOR_SET_RECURSIVE(it);
if (!it->node) {
b_iterator_set_status(it_obj, B_ERR_NO_DATA);
fx_iterator_set_status(it_obj, FX_ERR_NO_DATA);
}
return it_obj;
}
const b_iterator *b_tree_node_cbegin_recursive(const struct b_tree_node *node)
const fx_iterator *fx_tree_node_cbegin_recursive(const struct fx_tree_node *node)
{
return b_tree_node_begin_recursive((struct b_tree_node *)node);
return fx_tree_node_begin_recursive((struct fx_tree_node *)node);
}
/*** VIRTUAL FUNCTIONS ********************************************************/
static void tree_init(b_object *obj, void *priv)
static void tree_init(fx_object *obj, void *priv)
{
struct b_tree_p *tree = priv;
struct fx_tree_p *tree = priv;
}
static void tree_fini(b_object *obj, void *priv)
static void tree_fini(fx_object *obj, void *priv)
{
struct b_tree_p *tree = priv;
struct fx_tree_p *tree = priv;
}
/*** ITERATOR FUNCTIONS *******************************************************/
static enum b_status iterator_move_next(const b_iterator *obj)
static enum fx_status iterator_move_next(const fx_iterator *obj)
{
struct b_tree_iterator_p *it
= b_object_get_private(obj, B_TYPE_TREE_ITERATOR);
struct fx_tree_iterator_p *it
= fx_object_get_private(obj, FX_TYPE_TREE_ITERATOR);
int depth_diff = 0;
const struct b_tree_node *next
const struct fx_tree_node *next
= next_node(it->node, ITERATOR_IS_RECURSIVE(it), &depth_diff);
if (next) {
@@ -269,27 +269,27 @@ static enum b_status iterator_move_next(const b_iterator *obj)
it->i = 0;
}
it->node = (struct b_tree_node *)next;
return (it->node != NULL) ? B_SUCCESS : B_ERR_NO_DATA;
it->node = (struct fx_tree_node *)next;
return (it->node != NULL) ? FX_SUCCESS : FX_ERR_NO_DATA;
}
static enum b_status iterator_erase(b_iterator *obj)
static enum fx_status iterator_erase(fx_iterator *obj)
{
struct b_tree_iterator_p *it
= b_object_get_private(obj, B_TYPE_TREE_ITERATOR);
struct fx_tree_iterator_p *it
= fx_object_get_private(obj, FX_TYPE_TREE_ITERATOR);
if (!it->node) {
return B_ERR_OUT_OF_BOUNDS;
return FX_ERR_OUT_OF_BOUNDS;
}
struct b_tree_node *parent = NODE_PARENT(it->node);
struct fx_tree_node *parent = NODE_PARENT(it->node);
if (!parent) {
return B_ERR_NOT_SUPPORTED;
return FX_ERR_NOT_SUPPORTED;
}
int d = 0;
struct b_tree_node *n = it->node;
struct b_tree_node *next = NODE_NEXT_SIBLING(n);
struct fx_tree_node *n = it->node;
struct fx_tree_node *next = NODE_NEXT_SIBLING(n);
if (!next) {
next = NODE_FIRST_CHILD(n);
@@ -308,73 +308,73 @@ static enum b_status iterator_erase(b_iterator *obj)
remove_node(it->node);
reparent_children(it->node, parent);
return B_SUCCESS;
return FX_SUCCESS;
}
static b_iterator_value iterator_get_value(b_iterator *obj)
static fx_iterator_value iterator_get_value(fx_iterator *obj)
{
struct b_tree_iterator_p *it
= b_object_get_private(obj, B_TYPE_TREE_ITERATOR);
struct fx_tree_iterator_p *it
= fx_object_get_private(obj, FX_TYPE_TREE_ITERATOR);
if (!it->node) {
return B_ITERATOR_VALUE_NULL;
return FX_ITERATOR_VALUE_NULL;
}
return B_ITERATOR_VALUE_PTR(it->node);
return FX_ITERATOR_VALUE_PTR(it->node);
}
static const b_iterator_value iterator_get_cvalue(const b_iterator *obj)
static const fx_iterator_value iterator_get_cvalue(const fx_iterator *obj)
{
struct b_tree_iterator_p *it
= b_object_get_private(obj, B_TYPE_TREE_ITERATOR);
struct fx_tree_iterator_p *it
= fx_object_get_private(obj, FX_TYPE_TREE_ITERATOR);
if (!it->node) {
return B_ITERATOR_VALUE_NULL;
return FX_ITERATOR_VALUE_NULL;
}
return B_ITERATOR_VALUE_CPTR(it->node);
return FX_ITERATOR_VALUE_CPTR(it->node);
}
/*** CLASS DEFINITION *********************************************************/
// ---- b_tree DEFINITION
B_TYPE_CLASS_DEFINITION_BEGIN(b_tree)
B_TYPE_CLASS_INTERFACE_BEGIN(b_object, B_TYPE_OBJECT)
B_INTERFACE_ENTRY(to_string) = NULL;
B_TYPE_CLASS_INTERFACE_END(b_object, B_TYPE_OBJECT)
// ---- fx_tree DEFINITION
FX_TYPE_CLASS_DEFINITION_BEGIN(fx_tree)
FX_TYPE_CLASS_INTERFACE_BEGIN(fx_object, FX_TYPE_OBJECT)
FX_INTERFACE_ENTRY(to_string) = NULL;
FX_TYPE_CLASS_INTERFACE_END(fx_object, FX_TYPE_OBJECT)
B_TYPE_CLASS_INTERFACE_BEGIN(b_iterable, B_TYPE_ITERABLE)
B_INTERFACE_ENTRY(it_begin) = b_tree_begin;
B_INTERFACE_ENTRY(it_cbegin) = b_tree_cbegin;
B_TYPE_CLASS_INTERFACE_END(b_iterable, B_TYPE_ITERABLE)
B_TYPE_CLASS_DEFINITION_END(b_tree)
FX_TYPE_CLASS_INTERFACE_BEGIN(fx_iterable, FX_TYPE_ITERABLE)
FX_INTERFACE_ENTRY(it_begin) = fx_tree_begin;
FX_INTERFACE_ENTRY(it_cbegin) = fx_tree_cbegin;
FX_TYPE_CLASS_INTERFACE_END(fx_iterable, FX_TYPE_ITERABLE)
FX_TYPE_CLASS_DEFINITION_END(fx_tree)
B_TYPE_DEFINITION_BEGIN(b_tree)
B_TYPE_ID(0x8d8fa36b, 0xc515, 0x4803, 0x8124, 0xfd704f01b8ae);
B_TYPE_CLASS(b_tree_class);
B_TYPE_IMPLEMENTS(B_TYPE_ITERABLE);
B_TYPE_INSTANCE_PRIVATE(struct b_tree_p);
B_TYPE_INSTANCE_INIT(tree_init);
B_TYPE_INSTANCE_FINI(tree_fini);
B_TYPE_DEFINITION_END(b_tree)
FX_TYPE_DEFINITION_BEGIN(fx_tree)
FX_TYPE_ID(0x8d8fa36b, 0xc515, 0x4803, 0x8124, 0xfd704f01b8ae);
FX_TYPE_CLASS(fx_tree_class);
FX_TYPE_IMPLEMENTS(FX_TYPE_ITERABLE);
FX_TYPE_INSTANCE_PRIVATE(struct fx_tree_p);
FX_TYPE_INSTANCE_INIT(tree_init);
FX_TYPE_INSTANCE_FINI(tree_fini);
FX_TYPE_DEFINITION_END(fx_tree)
// ---- b_tree_iterator DEFINITION
B_TYPE_CLASS_DEFINITION_BEGIN(b_tree_iterator)
B_TYPE_CLASS_INTERFACE_BEGIN(b_object, B_TYPE_OBJECT)
B_INTERFACE_ENTRY(to_string) = NULL;
B_TYPE_CLASS_INTERFACE_END(b_object, B_TYPE_OBJECT)
// ---- fx_tree_iterator DEFINITION
FX_TYPE_CLASS_DEFINITION_BEGIN(fx_tree_iterator)
FX_TYPE_CLASS_INTERFACE_BEGIN(fx_object, FX_TYPE_OBJECT)
FX_INTERFACE_ENTRY(to_string) = NULL;
FX_TYPE_CLASS_INTERFACE_END(fx_object, FX_TYPE_OBJECT)
B_TYPE_CLASS_INTERFACE_BEGIN(b_iterator, B_TYPE_ITERATOR)
B_INTERFACE_ENTRY(it_move_next) = iterator_move_next;
B_INTERFACE_ENTRY(it_erase) = iterator_erase;
B_INTERFACE_ENTRY(it_get_value) = iterator_get_value;
B_INTERFACE_ENTRY(it_get_cvalue) = iterator_get_cvalue;
B_TYPE_CLASS_INTERFACE_END(b_iterator, B_TYPE_ITERATOR)
B_TYPE_CLASS_DEFINITION_END(b_tree_iterator)
FX_TYPE_CLASS_INTERFACE_BEGIN(fx_iterator, FX_TYPE_ITERATOR)
FX_INTERFACE_ENTRY(it_move_next) = iterator_move_next;
FX_INTERFACE_ENTRY(it_erase) = iterator_erase;
FX_INTERFACE_ENTRY(it_get_value) = iterator_get_value;
FX_INTERFACE_ENTRY(it_get_cvalue) = iterator_get_cvalue;
FX_TYPE_CLASS_INTERFACE_END(fx_iterator, FX_TYPE_ITERATOR)
FX_TYPE_CLASS_DEFINITION_END(fx_tree_iterator)
B_TYPE_DEFINITION_BEGIN(b_tree_iterator)
B_TYPE_ID(0xb896e671, 0x84b2, 0x4892, 0xaf09, 0x407f305f4bf8);
B_TYPE_EXTENDS(B_TYPE_ITERATOR);
B_TYPE_CLASS(b_tree_iterator_class);
B_TYPE_INSTANCE_PRIVATE(struct b_tree_iterator_p);
B_TYPE_DEFINITION_END(b_tree_iterator)
FX_TYPE_DEFINITION_BEGIN(fx_tree_iterator)
FX_TYPE_ID(0xb896e671, 0x84b2, 0x4892, 0xaf09, 0x407f305f4bf8);
FX_TYPE_EXTENDS(FX_TYPE_ITERATOR);
FX_TYPE_CLASS(fx_tree_iterator_class);
FX_TYPE_INSTANCE_PRIVATE(struct fx_tree_iterator_p);
FX_TYPE_DEFINITION_END(fx_tree_iterator)