-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathexecute.c
139 lines (129 loc) · 2.94 KB
/
execute.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
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
/* ************************************************************************** */
/* */
/* ::: :::::::: */
/* execute.c :+: :+: :+: */
/* +:+ +:+ +:+ */
/* By: dfurneau <[email protected]> +#+ +:+ +#+ */
/* +#+#+#+#+#+ +#+ */
/* Created: 2021/12/09 01:50:19 by dfurneau #+# #+# */
/* Updated: 2021/12/09 02:02:58 by dfurneau ### ########.fr */
/* */
/* ************************************************************************** */
#include "./includes/push_swap.h"
/**
* Execute RRR and RR
**/
static void execute_rrr(t_ops *ops, int p)
{
int i;
i = -1;
if (ops->ops[0][p] < 0)
while (++i < ft_abs(ops->ops[0][p]))
rrr(ops->a, ops->b);
else
while (++i < ft_abs(ops->ops[0][p]))
rr(ops->a, ops->b);
}
/**
* Execute RR and RA or RB
**/
static void execute_rr_rab(t_ops *ops, int p)
{
int i;
if (ops->ops[0][p] > ops->ops[1][p])
{
i = -1;
while (++i < ft_abs(ops->ops[1][p]))
rr(ops->a, ops->b);
i = -1;
while (++i < (ops->ops[0][p] - ops->ops[1][p]))
rb(ops->b);
}
else
{
i = -1;
while (++i < ft_abs(ops->ops[0][p]))
rr(ops->a, ops->b);
i = -1;
while (++i < (ops->ops[1][p] - ops->ops[0][p]))
ra(ops->a);
}
}
/**
* Execute RRR and RRA or RRB
**/
static void execute_rrr_rrab(t_ops *ops, int p)
{
int i;
if (ft_abs(ops->ops[0][p]) > ft_abs(ops->ops[1][p]))
{
i = -1;
while (++i < ft_abs(ops->ops[1][p]))
rrr(ops->a, ops->b);
i = -1;
while (++i < (ft_abs(ops->ops[0][p]) - ft_abs(ops->ops[1][p])))
rrb(ops->b);
}
else
{
i = -1;
while (++i < ft_abs(ops->ops[0][p]))
rrr(ops->a, ops->b);
i = -1;
while (++i < (ft_abs(ops->ops[1][p]) - ft_abs(ops->ops[0][p])))
rra(ops->a);
}
}
/**
* Execute RRA or RRB or RA or RB
**/
static void execute_rrab_rab(t_ops *ops, int p)
{
int i;
i = -1;
if (ops->ops[0][p] < 0)
{
while (++i < ft_abs(ops->ops[0][p]))
rrb(ops->b);
}
else if (ops->ops[0][p] > 0)
{
while (++i < ops->ops[0][p])
rb(ops->b);
}
i = -1;
if (ops->ops[1][p] < 0)
{
while (++i < ft_abs(ops->ops[1][p]))
rra(ops->a);
}
else if (ops->ops[1][p] > 0)
{
while (++i < ops->ops[1][p])
ra(ops->a);
}
}
/**
* Executer -- Execute the operations based
* on the least amount of moves
**/
void execute_ops(t_ops *ops, int p)
{
if (ops->ops[0][p] == ops->ops[1][p])
{
execute_rrr(ops, p);
}
else if (ops->ops[0][p] > 0 && ops->ops[1][p] > 0)
{
execute_rr_rab(ops, p);
}
else if (ops->ops[0][p] < 0 && ops->ops[1][p] < 0)
{
execute_rrr_rrab(ops, p);
}
else
{
execute_rrab_rab(ops, p);
}
pa(ops->a, ops->b);
}