/* ************************************************************************** */
/*                                                                            */
/*                                                        :::      ::::::::   */
/*   search_map.c                                       :+:      :+:    :+:   */
/*                                                    +:+ +:+         +:+     */
/*   By: hulamy <marvin@42.fr>                      +#+  +:+       +#+        */
/*                                                +#+#+#+#+#+   +#+           */
/*   Created: 2019/04/27 20:47:22 by hulamy            #+#    #+#             */
/*   Updated: 2019/04/28 01:08:55 by hulamy           ###   ########.fr       */
/*                                                                            */
/* ************************************************************************** */

#include "fillit.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);
}


/*
** DELETE BEFORE EVAL - TEST FUNCTION
** print a map of height and width
*/

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

	i = 0;
	mask = ~0u << (32 - width);
	while (i < width * height)
	{
		if (i && !(i % width))
			ft_putnbrendl(i);	// pour imprimer les tailles du tableaux pour faciliter sa verification
		tab[i / 32] & (1 << (31 - i % 32)) ? ft_putchar('#') : ft_putchar('.');
		ft_putchar(' ');
		i++;
	}
	write(1, "\n", 1);
}

void	find_place(unsigned int *tab, t_fillist *list, int size)
{
	int				i;
	int				j;
	unsigned int	mask;
	unsigned int	tmp;

	// creer un mask avec les size bits de gauche a 1 (ex: 11111110000000000000000000000000)
	mask = ~0u << (32 - list->width);
	tmp = mask;
	i = 0;
	// boucle jusqu'a la dernier place pour le tetri dans la map ou qu'il fit dans un trou
	while (i < (size - list->height + 1) * size && (tmp >> 16) & list->tetribit)
	{
		tmp = 0;
		j = list->height * size + i;
		while (j >= i)
		{
			tmp >>= list->width;
			tmp |= (mask & (tab[j / 32] << j));
			tmp |= (mask & (tab[(j + size) / 32] >> (32 - j)));
			j -= size;
		}
		// test pour imprimer la "photo de la map"
		print_bits(tmp >> 16, 32);
		if (i % size == size - list->width)
			i += list->width - 1;
		i++;
	}
	// ligne de test pour imprimer la position a laquelle le tetri a trouve une place
	ft_putnbrendl(((i - list->width) % size == size - list->width) ? i - list->width : i);
}

void	search_map(t_fillist *list)
{
	unsigned int	tmp;
	unsigned int	tab[8];
	t_fillist		*print;

	// 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_map(tab, 10, 10);
	print = list;
	while (print)
	{
		// imression pour tests
		tmp = print->tetribit;
		tmp <<= 16;
		print_map(&tmp, print->width, print->height);
		ft_putchar('\n');
		find_place(tab, print, 10);
		print = print->next;
	}
//	find_place(tab, list, 10);
}