-
Notifications
You must be signed in to change notification settings - Fork 0
/
ft_lstget.c
67 lines (58 loc) · 1.79 KB
/
ft_lstget.c
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
/* ************************************************************************** */
/* */
/* ::: :::::::: */
/* ft_lstget.c :+: :+: :+: */
/* +:+ +:+ +:+ */
/* By: lgasc <lgasc@student.42.fr> +#+ +:+ +#+ */
/* +#+#+#+#+#+ +#+ */
/* Created: 2024/02/07 17:19:40 by lgasc #+# #+# */
/* Updated: 2024/02/27 21:56:02 by lgasc ### ########.fr */
/* */
/* ************************************************************************** */
#include <stddef.h>
#include "bonus.h"
#ifdef TEST
# include "libft.h"
#endif
///Get the node at the given `offset` in the `list`, if it exists
///XXX: You should not need to call this function;
/// you might be using lunk lists wrong!
__attribute__ ((warn_unused_result))
t_node *ft_lstget(const t_list list, const size_t offset)
{
size_t i;
t_node *node;
node = list;
i = 0;
while (i < offset && node != NULL)
node = node->next;
return (node);
}
__attribute__ ((warn_unused_result))
t_inode *ft_ilstget(const t_ilist list, const size_t offset)
{
size_t i;
t_inode *node;
node = list;
i = 0;
while (i < offset && node != NULL)
{
node = node->next;
++i;
}
return (node);
}
__attribute__ ((warn_unused_result))
t_znode *ft_zlstget(const t_zlist list, const size_t offset)
{
size_t i;
t_znode *node;
node = list;
i = 0;
while (i < offset && node != NULL)
{
node = node->next;
++i;
}
return (node);
}