fillit/set_tet.c at master · meghancodes/fillit · GitHub

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
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
#include "fillit.h"
#include <stdio.h>

/*
** Check if the shape is one of the shapes that need extra dots
*/

int		check_shape(t_type *type)
{
	if (!ft_strcmp(type->name, "T2") || !ft_strcmp(type->name, "T3")
		|| !ft_strcmp(type->name, "J1")
		|| !ft_strcmp(type->name, "Z2") || !ft_strcmp(type->name, "S1"))
		return (1);
	if (!ft_strcmp(type->name, "L4"))
		return (2);
	return (0);
}

int		check_around(t_map *map, int x, int y)
{
	if (x + 1 < map->size)
	{
		if (ft_isalpha(map->arr[x + 1][y]))
			return (1);
	}
	if (x - 1 >= 0)
	{
		if (ft_isalpha(map->arr[x - 1][y]))
			return (1);
	}
	if (y + 1 < map->size)
	{
		if (ft_isalpha(map->arr[x][y + 1]))
			return (1);
	}
	if (y - 1 >= 0)
	{
		if (ft_isalpha(map->arr[x][y - 1]))
			return (1);
	}
	return (0);
}

/*
** Checks top, right, bottom and left of each coordinate for a 1
** Also checks if the coordinates are okay for the tet
*/

int		valid_set(t_tet *tet, t_map *map, int x, int y)
{
	int count;
	int lines;

	tet->x = x;
	tet->y = y;
	count = 0;
	lines = check_shape(tet->type);
	if (lines > y || is_big_enough(map, tet, lines))
		return (0);
	if (is_empty_map(map))
		return (1);
	else
		count = fill_in(tet, map, lines, x, y, count);
	if (count)
		return (1);
	return (0);
}

int		fill_in(t_tet *tet, t_map *map, int lines, int x, int y, int count)
{
	int i;

	i = 0;
	while (tet->type->shape[i] != '\0')
	{
		if (lines == 4)
		{
			x++;
			y = tet->y - check_shape(tet->type);
			lines = 0;
		}
		if (tet->type->shape[i] == '#')
		{
			if (ft_isalpha(map->arr[x][y]))
				return (0);
			count += check_around(map, x, y);
			y++;
		}
		else if (tet->type->shape[i] == '.')
			y++;
		i++;
		lines++;
	}
	return (count);
}

/*
** Checks whether the map is large enough to fit a shape at an XY
*/

int		is_big_enough(t_map *map, t_tet *tet, int lines)
{
	int	x;
	int	y;

	x = tet->x + tet->h;
	y = tet->y + tet->w - lines;
	if (x > map->size - 1 || y > map->size - 1)
	{
		if (x > y)
			return (x + 1);
		else
			return (y + 1);
	}
	return (0);
}

/*
**  Checks if map is empty
*/

int		is_empty_map(t_map *map)
{
	int i;
	int j;

	i = 0;
	while (i < map->size)
	{
		j = 0;
		while (j < map->size)
		{
			if (ft_isalpha(map->arr[i][j]))
				return (0);
			j++;
		}
		i++;
	}
	return (1);
}

t_tet	*set_tet(t_tet *tet, char fill, t_map *map, int x, int y)
{
	int i;
	int lines;

	tet->x = x;
	tet->y = y;
	i = 0;
	lines = check_shape(tet->type);
	while (tet->type->shape[i] != '\0')
	{
		if (lines == 4)
		{
			x++;
			y = tet->y - check_shape(tet->type);
			lines = 0;
		}
		if (tet->type->shape[i] == '#')
		{
			map->arr[x][y] = fill;
			y++;
		}
		else if (tet->type->shape[i] == '.')
			y++;
		i++;
		lines++;
	}
	return (tet->next);
}

void	unset_tet(t_map *map, t_tet *tet)
{
	int	i;
	int	lines;
	int	x;
	int	y;

	i = 0;
	x = tet->x;
	y = tet->y;
	lines = check_shape(tet->type);
	while (tet->type->shape[i] != '\0')
	{
		if (lines == 4)
		{
			x++;
			y = tet->y - check_shape(tet->type);
			lines = 0;
		}
		if (tet->type->shape[i] == '#')
		{
			map->arr[x][y] = '.';
			y++;
		}
		else if (tet->type->shape[i] == '.')
			y++;
		i++;
		lines++;
	}
}