-
Notifications
You must be signed in to change notification settings - Fork 0
/
parser_bonus.c
113 lines (103 loc) · 2.22 KB
/
parser_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
107
108
109
110
111
112
113
/* ************************************************************************** */
/* */
/* ::: :::::::: */
/* parser_bonus.c :+: :+: :+: */
/* +:+ +:+ +:+ */
/* By: yrigny <marvin@42.fr> +#+ +:+ +#+ */
/* +#+#+#+#+#+ +#+ */
/* Created: 2024/01/08 19:23:13 by yrigny #+# #+# */
/* Updated: 2024/01/08 19:23:15 by yrigny ### ########.fr */
/* */
/* ************************************************************************** */
#include "push_swap_bonus.h"
bool numeric(char *ar)
{
int i;
i = 0;
if (ar[0] == '-' && ar[1] && ft_strchr("123456789", ar[1]))
i++;
while (ar[i])
{
if (!ft_strchr("0123456789", ar[i]))
return (0);
i++;
}
if (i == 0 || i > 11)
return (0);
if (ar[0] == '0' && ar[1])
return (0);
return (1);
}
bool unique(int nb, t_stack *a)
{
if (a == NULL)
return (1);
while (a)
{
if (a->data == nb)
return (0);
a = a->next;
}
return (1);
}
int get_idx(int nb, t_stack *a)
{
int idx;
idx = 1;
while (a)
{
if (nb == a->data)
return (0);
if (nb > a->data)
idx++;
if (nb < a->data)
a->idx++;
a = a->next;
}
return (idx);
}
bool get_nb(char *ar, t_stack **a)
{
long nb;
t_stack *new;
new = NULL;
if (!numeric(ar))
return (0);
nb = ft_atol(ar);
if (nb > INT_MAX || nb < INT_MIN)
return (0);
if (!unique((int)nb, *a))
return (0);
new = malloc(sizeof(t_stack));
if (!new)
return (0);
new->data = (int)nb;
new->idx = get_idx((int)nb, *a);
new->next = NULL;
if (*a == NULL)
*a = new;
else
lastnb(*a)->next = new;
return (1);
}
bool parser(int argc, char **arg, t_stack **a)
{
int i;
bool data_ok;
i = 0;
data_ok = 1;
if (!(*arg))
data_ok = 0;
while (data_ok && arg[i])
{
if (!get_nb(arg[i], a))
{
data_ok = 0;
free_stack(a);
}
i++;
}
if (argc == 2)
free_arg(arg);
return (data_ok);
}