#include "./libft/includes/libft.h"

void	print_bits(unsigned int bits, int size)
{
	unsigned int	mask;

	mask = 1 << (size - 1);
	while (mask)
	{
		(bits & mask) ? write(1, "#", 1) : write(1, ".", 1);
		write(1, " ", 1);
		mask >>= 1;
	}
	write(1, "\n", 1);
}

void	print_map(unsigned int *tab, int width, int height)
{
	int				i;
	unsigned int	mask;

	i = 0;
	// creer un mask avec les size bits de gauche a 1 (ex: 11111110000000000000000000000000)
	mask = ~0u << (32 - width);
	while (i < width * height)
	{
		if (!(i % width))
			ft_putchar('\n');
		tab[i / 32] & (1 << (31 - i % 32)) ? ft_putchar('#') : ft_putchar('.');
		ft_putchar(' ');
		i++;
	}
	write(1, "\n", 1);
}

void	find_place(unsigned int *tab, char *line, int size)
{
	unsigned short	tetri;
	int				i;
	int				j;
	unsigned int	mask;
	unsigned int	tmp;
	int				width;
	int				height;

	/////////////// create tetri ///////////////
	i = 0;
	tmp = 0;
	width = 3;
	height = 2;
	while (line[i])
	{
		tetri <<= 1;
		if (line[i] == '\n')
			i++;
		if (line[i++] == '#')
			tetri |= 1;
	}
	while (!(tetri & (1 << 15)))
		tetri <<= 1;
	print_bits(tetri, 16);
	tmp = (tetri | tmp) << 16;
	print_map(&tmp, width, height);
	/////////////// create tetri ///////////////

	mask = ~0;
	mask <<= 32 - width;
	ft_putendl("mask: ");
	print_bits(mask, 32);
	i = 0;
	while (i < (size - height + 1) * size)
	{
		tmp = 0;
		j = height * size + i;
		while (j >= i)
		{
			tmp >>= width;
			tmp |= (mask & (tab[j / 32] << j));
			tmp |= (mask & (tab[(j + size) / 32] >> (32 - j)));
			j -= size;
		}
		print_map(&tmp, width, height);
		print_bits(tmp >> 16, 32);
		print_bits(tetri, 32);
		print_bits((tmp >> 16) & tetri, 32);
		if (i % size == size - width)
			i += width - 1;
		i++;
	}
}

int		main(int ac, char **av)
{
	unsigned int	tab[8];

	// ce tableau permet de monter jusqu'a une map de 16*16
	tab[0] = 2656554334;
	tab[1] = 1394456818;
	tab[2] = 1494256918;
	tab[3] = 2656554334;
	tab[4] = 1592453883;
	tab[5] = 1444352908;
	tab[6] = 2154339230;
	tab[7] = 1576493154;
	print_bits(tab[0], 32);
	print_bits(tab[1], 32);
	print_bits(tab[2], 32);
	print_bits(tab[3], 32);
	print_bits(tab[4], 32);
	print_bits(tab[5], 32);
	print_bits(tab[6], 32);
	print_bits(tab[7], 32);
	if (ac > 1)
	{
		++av;
		// mettre l'option "b" pour afficher la troisieme argument en binaire
		if (av[0][0] == 'b' && ac > 2)
			ft_putendl(ft_convertbase(av[1], "01", "0123456789"));
		print_map(tab, 10, 10);
		write(1, "\n", 1);
		if (av[0][0] == 't' && ac > 2)
			find_place(tab, av[1], 10);
	}
	return (0);
}