so_long/map_checker.c at main · lapenji/so_long · 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
/* ************************************************************************** */
/*                                                                            */
/*                                                        :::      ::::::::   */
/*   map_checker.c                                      :+:      :+:    :+:   */
/*                                                    +:+ +:+         +:+     */
/*   By: ltombell <[email protected]>                    +#+  +:+       +#+        */
/*                                                +#+#+#+#+#+   +#+           */
/*   Created: 2022/11/08 16:19:10 by ltombell          #+#    #+#             */
/*   Updated: 2022/11/09 17:43:06 by ltombell         ###   ########.fr       */
/*                                                                            */
/* ************************************************************************** */

#include "so_long.h"

int	checkchar(char **map, int rows, char c)
{
	int	i;
	int	x;
	int	counter;

	i = 0;
	x = 1;
	counter = 0;
	while (x < rows)
	{
		i = 0;
		while (map[x][i])
		{
			if (map[x][i] == c)
				counter++;
			i++;
		}
		x++;
	}
	return (counter);
}

int	checkupndownwalls(char **map, int rows)
{
	int	i;

	i = 0;
	while (map[0][i] != '\n')
	{
		if (map[0][i] != '1')
			return (1);
		i++;
	}
	i = 0;
	while (map[rows][i] != '\n')
	{
		if (map[rows][i] != '1')
			return (1);
		i++;
	}
	return (0);
}

int	checkleftnrightwalls(char **map, int rows, int columns)
{
	int	i;

	i = 0;
	while (i < rows)
	{
		if (map[i][0] != '1' || map[i][columns -1] != '1')
			return (1);
		i++;
	}
	return (0);
}

int	firstmapcheck(t_program *dt)
{
	int	rows;
	int	columns;

	rows = count_height(dt->mp2);
	columns = count_base(dt->mp2);
	if (checkchar(dt->mp2, rows, 'C') < 1)
		return (1);
	if (checkchar(dt->mp2, rows, 'P') != 1)
		return (1);
	if (checkchar(dt->mp2, rows, 'E') != 1)
		return (1);
	if (checkchar(dt->mp2, rows, 'X') > 1)
		return (1);
	if (checkleftnrightwalls(dt->mp2, rows, columns) == 1)
		return (1);
	if (check_valid_chars(dt->mp2) == 1)
		return (1);
	if (check_map_square(dt) == 1)
		return (1);
	if (checkupndownwalls(dt->map, rows) == 1)
		return (1);
	return (0);
}

int	check_map(t_program *dt)
{
	int	i;
	int	y;

	y = 1;
	if (firstmapcheck(dt) == 1)
		return (1);
	while (dt->mp2[y] != 0)
	{
		i = 0;
		while (dt->mp2[y][i])
		{
			if (dt->mp2[y][i] == 'C' || dt->mp2[y][i] == 'P'
				|| dt->mp2[y][i] == 'E')
			{
				if (is_reachable(dt->mp2, y, i) == 1)
					return (1);
			}
			i++;
		}
		y++;
	}
	check_valid_path(dt);
	if (dt->ismapvalid == 1)
		return (1);
	return (0);
}