aboutsummaryrefslogtreecommitdiff
path: root/rush01/ex00/helper.c
blob: bab12d5785f2ae9ec7225529d811e0ac3782d0f6 (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
/* ************************************************************************** */
/*                                                                            */
/*                                                        :::      ::::::::   */
/*   helper.c                                           :+:      :+:    :+:   */
/*                                                    +:+ +:+         +:+     */
/*   By: cacharle <charles.cabergs@gmail.com>       +#+  +:+       +#+        */
/*                                                +#+#+#+#+#+   +#+           */
/*   Created: 2019/07/13 12:52:42 by cacharle          #+#    #+#             */
/*   Updated: 2019/07/14 17:44:58 by cacharle         ###   ########.fr       */
/*                                                                            */
/* ************************************************************************** */

#include <unistd.h>
#include "include.h"

void	ft_putchar(char c)
{
	write(1, &c, 1);
}

void	ft_putnbr(int nb)
{
	unsigned int	p_nb;

	p_nb = nb;
	if (nb < 0)
	{
		write(1, "-", 1);
		p_nb = -nb;
	}
	if (p_nb > 9)
		ft_putnbr(p_nb / 10);
	ft_putchar(p_nb % 10 + '0');
}

int		get_with_view(t_board board, t_view_point view, int view_line,
						int line_index)
{
	if (view == row_left)
		return (board[view_line][line_index]);
	if (view == row_right)
		return (board[view_line][3 - line_index]);
	if (view == col_up)
		return (board[line_index][view_line]);
	if (view == col_down)
		return (board[3 - line_index][view_line]);
	return (-1);
}

int		check_arg(char *str)
{
	int		i;

	i = 0;
	while (str[i])
	{
		if (!(str[i] >= '1' && str[i] <= '4'))
			return (FALSE);
		i++;
		if (!str[i])
			break ;
		if (str[i] != ' ')
			return (FALSE);
		i++;
	}
	if (i != 31)
		return (FALSE);
	return (TRUE);
}