From: Lukáš Jiřiště <gymnazium.jiriste@gmail.com>
Date: Sun, 3 Aug 2025 05:39:17 +0000 (+0200)
Subject: Fix comparison order
X-Git-Url: https://git.ljiriste.work/?a=commitdiff_plain;h=c37e2c45822acf3e2f5d357d119c9b0e7f0f3041;p=Libft.git

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 ea97937..8b834b1 100644
--- 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 3e3c79c..33dc3ea 100644
--- 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 ;