-
Notifications
You must be signed in to change notification settings - Fork 0
/
util_small_sort_proc.c
106 lines (101 loc) · 2.61 KB
/
util_small_sort_proc.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
/* ************************************************************************** */
/* */
/* ::: :::::::: */
/* util_small_sort_proc.c :+: :+: :+: */
/* +:+ +:+ +:+ */
/* By: yongmkim <[email protected]> +#+ +:+ +#+ */
/* +#+#+#+#+#+ +#+ */
/* Created: 2022/03/19 21:03:45 by yongmkim #+# #+# */
/* Updated: 2022/03/21 00:45:50 by yongmkim ### ########seoul.kr */
/* */
/* ************************************************************************** */
#include "pushswap.h"
int fn_sort_c(t_stack *stack, int key)
{
if (key & A)
{
return (sa(stack, stack->show));
}
else if (key & B)
{
if (ft_dlist_size(stack->b) == 3)
{
rrb(stack, stack->show);
return (fn_push_size(stack, 3));
}
rb(stack, stack->show, NULLL);
sb(stack, stack->show);
pa(stack, stack->show, NULLL);
rrb(stack, stack->show);
return (fn_push_size(stack, 2));
}
return (0);
}
int fn_sort_d(t_stack *stack, int key)
{
if (key & A)
{
if (ft_dlist_size(stack->a) == 3)
{
return (rra(stack, stack->show));
}
ra(stack, stack->show, NULLL);
sa(stack, stack->show);
rra(stack, stack->show);
return (sa(stack, stack->show));
}
else if (key & B)
{
sb(stack, stack->show);
return (fn_push_size(stack, 3));
}
return (0);
}
int fn_sort_e(t_stack *stack, int key)
{
if (key & A)
{
if (ft_dlist_size(stack->a) == 3)
return (ra(stack, stack->show, NULLL));
sa(stack, stack->show);
ra(stack, stack->show, NULLL);
sa(stack, stack->show);
return (rra(stack, stack->show));
}
else if (key & B)
{
if (ft_dlist_size(stack->b) == 3)
{
pa(stack, stack->show, NULLL);
sb(stack, stack->show);
return (fn_push_size(stack, 2));
}
rb(stack, stack->show, NULLL);
sb(stack, stack->show);
rrb(stack, stack->show);
return (fn_push_size(stack, 3));
}
return (0);
}
int fn_sort_f(t_stack *stack, int key)
{
if (key & A)
{
if (ft_dlist_size(stack->a) == 3)
{
sa(stack, stack->show);
return (rra(stack, stack->show));
}
ra(stack, stack->show, NULLL);
sa(stack, stack->show);
pb(stack, stack->show, NULLL);
rra(stack, stack->show);
sa(stack, stack->show);
return (pa(stack, stack->show, NULLL));
}
else if (key & B)
{
return (fn_push_size(stack, 3));
}
return (0);
}