42/42_old_fillit
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

find_place renvois la position du tetri dans la map

Browse Source
This commit is contained in:
Hugo LAMY
2019-04-28 02:24:27 +02:00
parent 003d2b3cbb
commit 1dd8a9e8c8
1 changed files with 8 additions and 8 deletions
Download Patch File Download Diff File Expand all files Collapse all files

16
search_map.c
View File

@@ -6,7 +6,7 @@
/* By: hulamy <marvin@42.fr> +#+ +:+ +#+ */ /* By: hulamy <marvin@42.fr> +#+ +:+ +#+ */
/* +#+#+#+#+#+ +#+ */ /* +#+#+#+#+#+ +#+ */
/* Created: 2019/04/27 20:47:22 by hulamy #+# #+# */ /* Created: 2019/04/27 20:47:22 by hulamy #+# #+# */
/* Updated: 2019/04/28 01:08:55 by hulamy ### ########.fr */ /* Updated: 2019/04/28 01:44:50 by hulamy ### ########.fr */
/* */ /* */
/* ************************************************************************** */ /* ************************************************************************** */
@@ -50,7 +50,7 @@ void print_map(unsigned int *tab, int width, int height)
write(1, "\n", 1); write(1, "\n", 1);
} }
void find_place(unsigned int *tab, t_fillist *list, int size) int find_place(unsigned int *tab, t_fillist *list, int size)
{ {
int i; int i;
int j; int j;
@@ -62,7 +62,7 @@ void find_place(unsigned int *tab, t_fillist *list, int size)
tmp = mask; tmp = mask;
i = 0; i = 0;
// boucle jusqu'a la dernier place pour le tetri dans la map ou qu'il fit dans un trou // 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) while (i < (size - list->height + 1) * size)
{ {
tmp = 0; tmp = 0;
j = list->height * size + i; j = list->height * size + i;
@@ -73,14 +73,14 @@ void find_place(unsigned int *tab, t_fillist *list, int size)
tmp |= (mask & (tab[(j + size) / 32] >> (32 - j))); tmp |= (mask & (tab[(j + size) / 32] >> (32 - j)));
j -= size; j -= size;
} }
// test pour imprimer la "photo de la map" // print_bits(tmp >> 16, 32); // test pour imprimer la "photo de la map"
print_bits(tmp >> 16, 32); if (!((tmp >> 16) & list->tetribit))
return (i + 1);
if (i % size == size - list->width) if (i % size == size - list->width)
i += list->width - 1; i += list->width - 1;
i++; i++;
} }
// ligne de test pour imprimer la position a laquelle le tetri a trouve une place return (0);
ft_putnbrendl(((i - list->width) % size == size - list->width) ? i - list->width : i);
} }
void search_map(t_fillist *list) void search_map(t_fillist *list)
@@ -106,8 +106,8 @@ void search_map(t_fillist *list)
tmp = print->tetribit; tmp = print->tetribit;
tmp <<= 16; tmp <<= 16;
print_map(&tmp, print->width, print->height); print_map(&tmp, print->width, print->height);
ft_putnbrendl(find_place(tab, print, 10));
ft_putchar('\n'); ft_putchar('\n');
find_place(tab, print, 10);
print = print->next; print = print->next;
} }
// find_place(tab, list, 10); // find_place(tab, list, 10);