-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathget_next_line_utils_bonus.c
105 lines (94 loc) · 2.16 KB
/
get_next_line_utils_bonus.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
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
/* ************************************************************************** */
/* */
/* ::: :::::::: */
/* get_next_line_utils_bonus.c :+: :+: :+: */
/* +:+ +:+ +:+ */
/* By: tpouget <[email protected]> +#+ +:+ +#+ */
/* +#+#+#+#+#+ +#+ */
/* Created: 2020/06/08 16:22:39 by tpouget #+# #+# */
/* Updated: 2020/06/08 17:03:11 by tpouget ### ########.fr */
/* */
/* ************************************************************************** */
#include "get_next_line_bonus.h"
size_t ft_strlen(const char *s)
{
size_t len;
len = 0;
while (*s)
{
s++;
len++;
}
return (len);
}
char *ft_strchr(const char *s, int c)
{
unsigned char value;
char *ptr;
value = (unsigned char)c;
ptr = (char *)s;
while (*ptr)
{
if (*ptr == value)
return (ptr);
ptr++;
}
if (!c)
return (ptr);
else
return (NULL);
}
char *ft_strdup(const char *s)
{
size_t i;
char *duplicate;
i = 0;
duplicate = malloc((ft_strlen(s) + 1) * sizeof(char));
if (!duplicate)
return (NULL);
while (s[i])
{
duplicate[i] = s[i];
i++;
}
duplicate[i] = '\0';
return (duplicate);
}
size_t ft_strlcpy(char *dst, const char *src, size_t size)
{
size_t i;
i = 0;
if (size > 0)
{
while (src[i])
{
if (i + 1 == size)
break ;
dst[i] = src[i];
i++;
}
dst[i] = '\0';
}
return (ft_strlen(src));
}
char *ft_strjoin(char const *s1, char const *s2)
{
size_t len;
char *joined;
size_t i;
if (!s1 && !s2)
return (NULL);
if (!s1 || !*s1)
return (ft_strdup(s2));
if (!s2 || !*s2)
return (ft_strdup(s1));
len = ft_strlen(s1) + ft_strlen(s2);
if (!(joined = malloc(len + 1)))
return (NULL);
ft_strlcpy(joined, s1, len + 1);
i = 0;
while (i < len + 1 && joined[i])
i++;
ft_strlcpy(joined + i, s2, len + 1 - i);
return (joined);
}