Fix comparison order

The t_rbtree_decide defines that lower nodes should be on let but I
consistently used the comparison function with the arguments switched so
the order was the other way around. This fixes it.

diff --git a/ft_struct/ft_rbtree_insert.c b/ft_struct/ft_rbtree_insert.c
index ea979370a1eb2262a7cc8d0cd11a6881397310a5..8b834b1cdb025e94744c6969e53f37919ab58d04 100644 (file)
--- a/ft_struct/ft_rbtree_insert.c
+++ b/ft_struct/ft_rbtree_insert.c
@@ -103,7 +103,7 @@ t_ft_stat   ft_rbtree_insert(t_rbtree *tree, void *element)
        cmp_el = node->tree->cmp_el;
        while (1)
        {
-               cmp_res = cmp_el(&node->data, element);
+               cmp_res = cmp_el(element, &node->data);
                next = ft_rbtree_decide(node, cmp_res);
                if (!next)
                        break ;

diff --git a/ft_struct/ft_rbtree_search_node.c b/ft_struct/ft_rbtree_search_node.c
index 3e3c79c35b90fdb3e23e0836c705d6aad3b20c63..33dc3ea6f380a950286032bf7ff8cf3d37bb6e9e 100644 (file)
--- a/ft_struct/ft_rbtree_search_node.c
+++ b/ft_struct/ft_rbtree_search_node.c
@@ -9,7 +9,7 @@ static t_rbtree_node    *find_node(t_rbtree_node *node, const void *element, t_cmp_
                return (NULL);
        while (1)
        {
-               cmp_res = cmp_el(&node->data, element);
+               cmp_res = cmp_el(element, &node->data);
                next = ft_rbtree_decide(node, cmp_res);
                if (!next)
                        break ;