summaryrefslogtreecommitdiff
path: root/src/main/game/cell.c
blob: 53d051ae4e32d0588e0ec44c2983dc0158b4b8e4 (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
/*-
 * Copyright (C) 2025  Alessandro Iezzi <aiezzi AT alessandroiezzi PERIOD it>
 *
 * This file is part of Tris Game.
 *
 * Tris Game is free software: you can redistribute it and/or modify
 * it under the terms of the GNU General Public License as published by
 * the Free Software Foundation, either version 3 of the License, or
 * (at your option) any later version.
 *
 * Tris Game is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 * GNU General Public License for more details.
 *
 * You should have received a copy of the GNU General Public License
 * along with Tris Game.  If not, see <http://www.gnu.org/licenses/>.
 */

#include <stdlib.h>
#include <stdbool.h>
#include <log.h>
#include "cell.h"

static Log *log = NULL;

static void
init_log(void)
{
	if (log != NULL) return;
	log = log_create("Cell");
}

Cell *
cell_new(float left, float right, float top, float bottom)
{
	init_log();

	Cell *cell = malloc(sizeof(Cell));
	if (cell == NULL) {
		log_error(log, "Error allocating memory for cell");
		exit(EXIT_FAILURE);
	}
	cell->left = left;
	cell->right = right;
	cell->top = top;
	cell->bottom = bottom;

	return cell;
}

bool
cell_within_bounds(Cell *cell, float x, float y)
{
	return x >= cell->left && x <= cell->right && y <= cell->top && y >= cell->bottom;
}