{
return ((char *)ft_rbtree_traverse(&traversal->traversal) + traversal->key_size);
}
+
+void ft_dict_traversal_free(t_dict_traversal *traversal)
+{
+ ft_rbtree_traversal_free(&traversal->traversal);
+ return ;
+}
node = ft_stack_pop_forget(&traversal->stack);
if (node && *node)
return (&(*node)->data);
- ft_stack_free(&traversal->stack, NULL);
+ ft_rbtree_traversal_free(traversal);
return (NULL);
}
+
+void ft_rbtree_traversal_free(t_rbtree_traversal *traversal)
+{
+ ft_stack_free(&traversal->stack, NULL);
+ return ;
+}
/* By: ljiriste <marvin@42.fr> +#+ +:+ +#+ */
/* +#+#+#+#+#+ +#+ */
/* Created: 2024/06/20 16:59:43 by ljiriste #+# #+# */
-/* Updated: 2025/08/14 14:33:38 by ljiriste ### ########.fr */
+/* Updated: 2025/08/14 14:41:41 by ljiriste ### ########.fr */
/* */
/* ************************************************************************** */
t_ft_stat ft_rbtree_traversal_init(t_rbtree_traversal *traversal, t_rbtree *tree, t_traversal_order order);
void *ft_rbtree_traverse(t_rbtree_traversal *traversal);
+void ft_rbtree_traversal_free(t_rbtree_traversal *traversal);
typedef struct s_dict
{
t_ft_stat ft_dict_traversal_init(t_dict_traversal *traversal, t_dict *dict);
void *ft_dict_traverse(t_dict_traversal *traversal);
+void ft_dict_traversal_free(t_dict_traversal *traversal);
# ifdef __cplusplus
}