Skip to content

Commit 93bb7ce

Browse files
committed
feat: Add ft_lstsize_d() to libft
1 parent 06d2497 commit 93bb7ce

File tree

3 files changed

+31
-1
lines changed

3 files changed

+31
-1
lines changed

libraries/libft/build/libft.mk

Lines changed: 1 addition & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -78,6 +78,7 @@ SRC += $(addprefix $(DIR), \
7878
ft_lstlast_d.c \
7979
ft_lstnew_back_d.c \
8080
ft_lstnew_d.c \
81+
ft_lstsize_d.c \
8182
)
8283

8384
# Singly-linked:

libraries/libft/inc/libft.h

Lines changed: 2 additions & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -6,7 +6,7 @@
66
/* By: ldulling <ldulling@student.42.fr> +#+ +:+ +#+ */
77
/* +#+#+#+#+#+ +#+ */
88
/* Created: 2023/09/24 16:17:46 by ldulling #+# #+# */
9-
/* Updated: 2024/06/07 18:59:14 by ldulling ### ########.fr */
9+
/* Updated: 2024/06/28 19:31:02 by ldulling ### ########.fr */
1010
/* */
1111
/* ************************************************************************** */
1212

@@ -60,6 +60,7 @@ void ft_lstiter_d(t_list_d *lst, void (*f)(void *));
6060
t_list_d *ft_lstlast_d(t_list_d *lst);
6161
bool ft_lstnew_back_d(t_list_d **lst, void *content);
6262
t_list_d *ft_lstnew_d(void *content);
63+
int ft_lstsize_d(t_list_d *lst);
6364

6465
\
6566
/* Lists singly-linked */
Lines changed: 28 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,28 @@
1+
/* ************************************************************************** */
2+
/* */
3+
/* ::: :::::::: */
4+
/* ft_lstsize_d.c :+: :+: :+: */
5+
/* +:+ +:+ +:+ */
6+
/* By: ldulling <ldulling@student.42.fr> +#+ +:+ +#+ */
7+
/* +#+#+#+#+#+ +#+ */
8+
/* Created: 2023/09/24 16:08:06 by ldulling #+# #+# */
9+
/* Updated: 2024/06/28 19:30:32 by ldulling ### ########.fr */
10+
/* */
11+
/* ************************************************************************** */
12+
13+
#include "libft.h"
14+
15+
int ft_lstsize_d(t_list_d *lst)
16+
{
17+
int n;
18+
t_list_d *cur;
19+
20+
n = 0;
21+
cur = lst;
22+
while (cur != NULL)
23+
{
24+
n++;
25+
cur = cur->next;
26+
}
27+
return (n);
28+
}

0 commit comments

Comments
 (0)