-
Notifications
You must be signed in to change notification settings - Fork 0
/
get_next_line_utils.c
103 lines (94 loc) · 2.37 KB
/
get_next_line_utils.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
/* ************************************************************************** */
/* */
/* ::: :::::::: */
/* get_next_line_utils.c :+: :+: :+: */
/* +:+ +:+ +:+ */
/* By: rnarciso <rnarciso@student.42.fr> +#+ +:+ +#+ */
/* +#+#+#+#+#+ +#+ */
/* Created: 2022/12/20 19:12:11 by rnarciso #+# #+# */
/* Updated: 2022/12/27 17:17:20 by rnarciso ### ########.fr */
/* */
/* ************************************************************************** */
#include "get_next_line.h"
ssize_t ft_strlen(const char *string)
{
ssize_t i;
i = 0;
if (!string)
return (0);
while (string[i])
i++;
return (i);
}
// will check for the first ocurrence of c
// and return the whole line
char *ft_strchr(const char *str, int c)
{
ssize_t i;
i = 0;
if (str == NULL)
return (NULL);
while (str[i] != '\0')
{
if (str[i] == (char)c)
return ((char *)str);
i++;
}
if (c == '\0')
return ((char *)str);
return (NULL);
}
// this will put together the contents on s1 with the contents on s2
char *ft_strjoin(char *s1, char *s2)
{
ssize_t i;
ssize_t i2;
char *res;
i = -1;
i2 = 0;
if (!s1 && s2)
{
s1 = (char *)malloc(1);
s1[0] = '\0';
}
if (!s1 || !s2)
return (NULL);
res = (char *)malloc(sizeof(char) * (ft_strlen(s1) + ft_strlen(s2) + 1));
if (!res)
return (NULL);
while (s1[++i])
res[i] = s1[i];
while (s2[i2])
res[i++] = s2[i2++];
res[i] = '\0';
free(s1);
return (res);
}
// this will be the pivotal aux funct as it updates the backlog
// and removes the extra from the read lines.
char *ft_substr(char const *s, unsigned int start, size_t len)
{
size_t i;
size_t i_2;
size_t i_3;
char *res;
char *ptr;
i = ft_strlen(s);
if (start > i)
len = 0;
if (len > i - start)
len = i - start;
ptr = ((res = (char *)malloc((len * sizeof(char)) + 1)));
if (!s || !ptr)
return (NULL);
i_2 = 0;
i_3 = 0;
while (s[i_2])
{
if (i_2 >= start && i_3 < len)
res[i_3++] = s[i_2];
i_2++;
}
res[i_3] = '\0';
return (res);
}