aboutsummaryrefslogtreecommitdiff
path: root/src/checker/check.c
blob: 1459dc601ecc22be85731fcfbc5ea678fc10c2f3 (plain)
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
/* ************************************************************************** */
/*                                                                            */
/*                                                        :::      ::::::::   */
/*   check.c                                            :+:      :+:    :+:   */
/*                                                    +:+ +:+         +:+     */
/*   By: cacharle <marvin@42.fr>                    +#+  +:+       +#+        */
/*                                                +#+#+#+#+#+   +#+           */
/*   Created: 2020/01/18 10:16:08 by cacharle          #+#    #+#             */
/*   Updated: 2021/09/10 10:26:47 by charles          ###   ########.fr       */
/*                                                                            */
/* ************************************************************************** */

#include "checker.h"

t_status	check(t_stack *a, t_stack *b)
{
	t_status	read_status;

	read_status = read_action(a, b);
	while (read_status != STATUS_EOF)
	{
		read_status = read_action(a, b);
		if (read_status == STATUS_ERROR)
			return (STATUS_ERROR);
	}
	if (stack_sorted(a) && stack_empty(b))
		return (STATUS_SUCCESS);
	else
		return (STATUS_FAILURE);
}

t_status	read_action(t_stack *a, t_stack *b)
{
	int		i;
	int		ret;
	char	c;
	char	buf[ACTION_ID_BUF_SIZE];

	ft_bzero(buf, sizeof(char) * 4);
	i = 0;
	while ((ret = read(STDIN_FILENO, &c, 1)) > 0)
	{
		if (c == '\n')
			return (exec_action(buf, a, b));
		if (i >= ACTION_ID_BUF_SIZE - 1)
			return (STATUS_ERROR);
		buf[i++] = c;
		buf[i] = '\0';
	}
	if (ret == 0)
		return (STATUS_EOF);
	else
		return (STATUS_ERROR);
}

static const t_action	g_actions[] = {
	{"sa", FLAG_ARG_A, {.arg_1 = &stack_swap}},
	{"sb", FLAG_ARG_B, {.arg_1 = &stack_swap}},
	{"ss", FLAG_ARG_A_B, {.arg_2 = &stack_swap_2}},
	{"pa", FLAG_ARG_B_A, {.arg_2 = &stack_push_to}},
	{"pb", FLAG_ARG_A_B, {.arg_2 = &stack_push_to}},
	{"ra", FLAG_ARG_A, {.arg_1 = &stack_rotate}},
	{"rb", FLAG_ARG_B, {.arg_1 = &stack_rotate}},
	{"rr", FLAG_ARG_A_B, {.arg_2 = &stack_rotate_2}},
	{"rra", FLAG_ARG_A, {.arg_1 = &stack_reverse_rotate}},
	{"rrb", FLAG_ARG_B, {.arg_1 = &stack_reverse_rotate}},
	{"rrr", FLAG_ARG_A_B, {.arg_2 = &stack_reverse_rotate_2}},
};

static const int		g_actions_size = sizeof(g_actions) / sizeof(t_action);

t_status	exec_action(char action_id[ACTION_ID_BUF_SIZE],
						t_stack *a, t_stack *b)
{
	int	i;

	i = 0;
	while (ft_strcmp(action_id, g_actions[i].id) != 0)
		i++;
	if (i == g_actions_size)
		return (STATUS_ERROR);
	if (g_actions[i].args == FLAG_ARG_A)
		g_actions[i].u_func.arg_1(a);
	else if (g_actions[i].args == FLAG_ARG_B)
		g_actions[i].u_func.arg_1(b);
	else if (g_actions[i].args == FLAG_ARG_A_B)
		g_actions[i].u_func.arg_2(a, b);
	else if (g_actions[i].args == FLAG_ARG_B_A)
		g_actions[i].u_func.arg_2(b, a);
	else
		return (STATUS_ERROR);
	return (STATUS_SUCCESS);
}

t_bool	stack_sorted(t_stack *stack)
{
	int	i;

	if (stack_length(stack) < 2)
		return (TRUE);
	i = stack->top + 1;
	while (--i > 0)
		if (stack->elements[i] > stack->elements[i - 1])
			return (FALSE);
	return (TRUE);
}