feat: added configuration and USE_SLIST

srcs/slist/ft_slist_clear.c

@@ -1,3 +1,4 @@
+#if USE_SLIST
 #include "libft.h"
 #include <stdlib.h>
 
@@ -10,4 +11,5 @@ void ft_slist_clear(t_slist **lst)
         free(*lst);
         *lst = tmp;
     }
-}
+}
+#endif

srcs/slist/ft_slist_empty.c

@@ -1,6 +1,8 @@
+#if USE_SLIST
 #include "libft.h"
 
 int ft_slist_empty(t_slist *lst)
 {
     return (lst == NULL);
-}
+}
+#endif

srcs/slist/ft_slist_find.c

@@ -1,3 +1,4 @@
+#if USE_SLIST
 #include "libft.h"
 
 t_slist *ft_slist_find(t_slist *lst, void *data, int (*cmp)(void *, void *))
@@ -9,4 +10,5 @@ t_slist *ft_slist_find(t_slist *lst, void *data, int (*cmp)(void *, void *))
         lst = lst->next;
     }
     return (NULL);
-}
+}
+#endif

srcs/slist/ft_slist_get.c

@@ -1,3 +1,4 @@
+#if USE_SLIST
 #include "libft.h"
 
 t_slist *ft_slist_get(t_slist *lst, int index)
@@ -10,3 +11,4 @@ t_slist *ft_slist_get(t_slist *lst, int index)
     }
     return ((i == index) ? lst : NULL);
 }
+#endif

srcs/slist/ft_slist_insert.c

@@ -1,3 +1,4 @@
+#if USE_SLIST
 #include "libft.h"
 
 int ft_slist_insert(t_slist **lst, t_slist *node, int index)
@@ -28,3 +29,4 @@ int ft_slist_insert(t_slist **lst, t_slist *node, int index)
     }
     return (-1);
 }
+#endif

srcs/slist/ft_slist_iter.c

@@ -1,3 +1,4 @@
+#if USE_SLIST
 #include "libft.h"
 
 void ft_slist_iter(t_slist *lst, void (*f)(void *))
@@ -8,3 +9,4 @@ void ft_slist_iter(t_slist *lst, void (*f)(void *))
         lst = lst->next;
     }
 }
+#endif

srcs/slist/ft_slist_new.c

@@ -1,3 +1,4 @@
+#if USE_SLIST
 #include "libft.h"
 
 t_slist *ft_slist_new(void *data)
@@ -11,4 +12,5 @@ t_slist *ft_slist_new(void *data)
     node->next = NULL;
 
     return node;
-}
+}
+#endif

srcs/slist/ft_slist_pop.c

@@ -1,3 +1,4 @@
+#if USE_SLIST
 #include "libft.h"
 
 t_slist *ft_list_pop(t_slist **lst)
@@ -21,3 +22,4 @@ t_slist *ft_list_pop(t_slist **lst)
     prev->next = NULL;
     return current;
 }
+#endif

srcs/slist/ft_slist_push.c

@@ -1,3 +1,4 @@
+#if USE_SLIST
 #include "libft.h"
 
 void ft_slist_push(t_slist **lst, t_slist *node)
@@ -20,3 +21,4 @@ void ft_slist_push(t_slist **lst, t_slist *node)
         current = current->next;
     current->next = node;
 }
+#endif

srcs/slist/ft_slist_reverse.c

@@ -1,3 +1,4 @@
+#if USE_SLIST
 #include "libft.h"
 
 void ft_slist_reverse(t_slist **lst)
@@ -15,3 +16,4 @@ void ft_slist_reverse(t_slist **lst)
     }
     *lst = prev;
 }
+#endif

srcs/slist/ft_slist_rm.c

@@ -1,3 +1,4 @@
+#if USE_SLIST
 #include "libft.h"
 
 void ft_slist_rm(t_slist **lst, void *data, int (*cmp)(void *, void *), void (*del)(void *))
@@ -21,4 +22,5 @@ void ft_slist_rm(t_slist **lst, void *data, int (*cmp)(void *, void *), void (*d
         prev = curr;
         curr = curr->next;
     }
-}
+}
+#endif

srcs/slist/ft_slist_shift.c

@@ -1,3 +1,4 @@
+#if USE_SLIST
 #include "libft.h"
 
 t_slist *ft_slist_shift(t_slist **lst)
@@ -11,3 +12,4 @@ t_slist *ft_slist_shift(t_slist **lst)
     first->next = NULL;
     return first;
 }
+#endif

srcs/slist/ft_slist_size.c

@@ -1,3 +1,4 @@
+#if USE_SLIST
 #include "libft.h"
 
 int ft_slist_size(t_slist *lst)
@@ -10,3 +11,4 @@ int ft_slist_size(t_slist *lst)
     }
     return size;
 }
+#endif

srcs/slist/ft_slist_unshift.c

@@ -1,3 +1,4 @@
+#if USE_SLIST
 #include "libft.h"
 
 void ft_slist_unshift(t_slist **lst, t_slist *node)
@@ -7,3 +8,4 @@ void ft_slist_unshift(t_slist **lst, t_slist *node)
     node->next = *lst;
     *lst = node;
 }
+#endif