-
Notifications
You must be signed in to change notification settings - Fork 0
/
get_next_line_utils_bonus.c
106 lines (96 loc) · 2.13 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
106
/* ************************************************************************** */
/* */
/* ::: :::::::: */
/* get_next_line_utils_bonus.c :+: :+: :+: */
/* +:+ +:+ +:+ */
/* By: ooussaad <ooussaad@student.1337.ma> +#+ +:+ +#+ */
/* +#+#+#+#+#+ +#+ */
/* Created: 2022/11/13 23:57:26 by ooussaad #+# #+# */
/* Updated: 2022/11/14 00:00:50 by ooussaad ### ########.fr */
/* */
/* ************************************************************************** */
#include "get_next_line.h"
void *ft_memcpy(void *dst, void *src, size_t n)
{
unsigned int i;
char *src_char;
char *dest_char;
i = 0;
src_char = (char *)src;
dest_char = (char *)dst;
if (dest_char == src_char)
return (dest_char);
if (dst == NULL && src == NULL)
return (NULL);
while (i < n)
{
dest_char[i] = src_char[i];
i++;
}
return (dst);
}
size_t ft_strlen(char *str)
{
size_t i;
i = 0;
while (str[i] != '\0')
{
i++;
}
return (i);
}
char *ft_strchr(char *s, int c)
{
if (!s)
return (NULL);
while (*s)
{
if (*s == (char )c)
{
return ((char *)s);
}
s++;
}
if ((char)c == '\0')
return ((char *)s);
return (NULL);
}
char *ft_strdup(char *s1)
{
char *s;
size_t len;
size_t i;
s = NULL;
len = ft_strlen(s1) + 1;
i = 0;
s = (char *)malloc (len * sizeof(char ));
if (!s || !s1)
return (NULL);
ft_memcpy (s, s1, len);
return (s);
}
char *ft_strjoin(char *s1, char *s2)
{
size_t len;
char *res;
size_t i;
size_t j;
i = 0;
j = 0;
if (!s2)
return (0);
if (!s1)
return (ft_strdup(s2));
len = ft_strlen(s1) + ft_strlen(s2);
res = (malloc(len * (sizeof (*res)) + 1));
if (!res)
return (NULL);
while (s1[j])
res[i++] = s1[j++];
j = 0;
while (s2[j])
res[i++] = s2[j++];
res[i] = 0;
free (s1);
return (res);
}