-
Notifications
You must be signed in to change notification settings - Fork 0
/
stacks.c
102 lines (89 loc) · 2.98 KB
/
stacks.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
/* ************************************************************************** */
/* */
/* ::: :::::::: */
/* stacks.c :+: :+: :+: */
/* +:+ +:+ +:+ */
/* By: lgasc <lgasc@student.42.fr> +#+ +:+ +#+ */
/* +#+#+#+#+#+ +#+ */
/* Created: 2024/01/31 18:25:10 by lgasc #+# #+# */
/* Updated: 2024/02/28 18:31:58 by lgasc ### ########.fr */
/* */
/* ************************************************************************** */
#include <stddef.h>
#include "libft/libft.h"
#include "libft/types.h"
#include "libft/bonus.h"
//#include "stacks.h"
#include "push_swap_types.h"
#ifndef TEST
# include "ft_printf/ft_printf.h"
void ft_print_stacks(const struct s_stacks stacks)
{
const t_inode *node;
ft_putstr_fd("stacks: { primary: [", 2);
node = stacks.primary;
while (node != NULL)
{
ft_putnbr_fd(node->datum, 2);
if (node->next != NULL)
ft_putstr_fd(", ", 2);
node = node->next;
}
ft_putstr_fd("], secondary: [", 2);
node = stacks.secondary;
while (node != NULL)
{
ft_putnbr_fd(node->datum, 2);
if (node->next != NULL)
ft_putstr_fd(", ", 2);
node = node->next;
}
ft_putendl_fd("] }", 2);
}
#else
void ft_print_stacks(const struct s_stacks stacks)
{
(void) stacks;
}
#endif
/*t_int_option ft_primary_top(const struct s_stacks stacks)
{
if (stacks.primary == NULL)
return ((t_int_option){.type = None});
return ((t_int_option){.type = Some, .value = stacks.primary->datum});
}
//\*t_int_option ft_primary_next(const struct s_stacks stacks)
{
size_t i;
i = 0;
while (i < stacks.size)
if (stacks.masks[(stacks.primary_top + i++) % stacks.size] & Primary)
while (1)
if (stacks.masks
[(stacks.primary_top + i++) % stacks.size] & Primary)
return ((struct s_int_option){.type = Some, .value = stacks
.primary[(stacks.primary_top + --i) % stacks.size]});
return ((struct s_int_option){.type = None});
(void) stacks;
exit(TODO + 3);
}*\/
t_int_option ft_primary_bottom(const struct s_stacks stacks)
{
if (stacks.primary == NULL)
return ((t_int_option){.type = None});
return ((t_int_option)
{.type = Some, .value = ft_ilstlast(stacks.primary)->datum});
}
t_int_option ft_secondary_top(const struct s_stacks stacks)
{
if (stacks.secondary == NULL)
return ((t_int_option){.type = None});
return ((t_int_option){.type = Some, .value = stacks.secondary->datum});
}
t_int_option ft_secondary_bottom(const struct s_stacks stacks)
{
if (ft_ilstplast(stacks.secondary) == NULL)
return ((t_int_option){.type = None});
return ((t_int_option)
{.type = Some, .value = ft_ilstplast(stacks.secondary)->datum});
}*/