-
Notifications
You must be signed in to change notification settings - Fork 0
/
utils.c
100 lines (90 loc) · 2.2 KB
/
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
/* ************************************************************************** */
/* */
/* ::: :::::::: */
/* utils.c :+: :+: :+: */
/* +:+ +:+ +:+ */
/* By: yait-iaz <yait-iaz@student.42.fr> +#+ +:+ +#+ */
/* +#+#+#+#+#+ +#+ */
/* Created: 2022/01/06 15:42:34 by yait-iaz #+# #+# */
/* Updated: 2022/01/13 17:08:13 by yait-iaz ### ########.fr */
/* */
/* ************************************************************************** */
#include "fract.h"
size_t ft_strlen(const char *s)
{
size_t l;
l = 0;
while (s[l] != '\0')
l++;
return (l);
}
size_t ft_strlcat(char *dst, const char *src, size_t dstsize)
{
int i;
int left;
size_t dst_l;
i = 0;
dst_l = ft_strlen(dst);
left = dstsize - dst_l - 1;
if (dstsize < dst_l)
return (dstsize + ft_strlen(src));
while (src[i] && left > 0)
{
dst[dst_l + i] = src[i];
left--;
i++;
}
dst[dst_l + i] = '\0';
return (dst_l + ft_strlen(src));
}
int is_hexa(char c)
{
if (c == 'a' || c == 'A')
return (10);
else if (c == 'b' || c == 'B')
return (11);
else if (c == 'c' || c == 'C')
return (12);
else if (c == 'd' || c == 'D')
return (13);
else if (c == 'e' || c == 'E')
return (14);
else if (c == 'f' || c == 'F')
return (15);
return (c - 48);
}
int ft_atoi_hex(char *str)
{
int i;
int result;
i = 0;
result = 0;
while (str[i] == '0' || str[i] == 'x')
i++;
while (str[i])
{
result *= 16;
result = result + is_hexa(str[i]);
i++;
}
return (result);
}
int ft_strncmp(const char *s1, const char *s2, size_t n)
{
size_t i;
unsigned char *str1;
unsigned char *str2;
i = 0;
str1 = (unsigned char *)s1;
str2 = (unsigned char *)s2;
while ((str1[i] != '\0' || str2[i] != '\0') && n > 0)
{
if (str1[i] != str2[i])
{
return (str1[i] - str2[i]);
}
i++;
n--;
}
return (0);
}