From 901402c99018422c994bdb297e3ba404969c88ea Mon Sep 17 00:00:00 2001
From: Charles <sircharlesaze@gmail.com>
Date: Mon, 30 Mar 2020 22:26:36 +0200
Subject: Added documentation for ht and lst

---
 src/lst/ft_lstsorted_merge.c | 10 +++++++++-
 1 file changed, 9 insertions(+), 1 deletion(-)

(limited to 'src/lst/ft_lstsorted_merge.c')

diff --git a/src/lst/ft_lstsorted_merge.c b/src/lst/ft_lstsorted_merge.c
index 4f5332c..0cd5721 100644
--- a/src/lst/ft_lstsorted_merge.c
+++ b/src/lst/ft_lstsorted_merge.c
@@ -12,6 +12,14 @@
 
 #include "libft_lst.h"
 
+/**
+** \brief      Merge sorted lists, the new list is also sorted
+** \param l1   First list
+** \param l2   Second list
+** \param cmp  Comparison function, <0 if less, 0 if equal, >0 if greater
+** \return     Pointer to first node of merged list
+*/
+
 t_ftlst	*ft_lstsorted_merge(t_ftlst *l1, t_ftlst *l2, t_ftcompar_func cmp)
 {
 	t_ftlst	*merged;
@@ -21,7 +29,7 @@ t_ftlst	*ft_lstsorted_merge(t_ftlst *l1, t_ftlst *l2, t_ftcompar_func cmp)
 		return (l2);
 	if (l2 == NULL)
 		return (l1);
-	if (cmp(l1->content, l2->content) < 0)
+	if (cmp(l1->data, l2->data) < 0)
 	{
 		merged = l1;
 		merged->next = ft_lstsorted_merge(l1->next, l2, cmp);
-- 
cgit