sauvegarde avant depart

deux opti ilots et identiques
ajout de l'effacement selectif lors de l'opti, pas ouf ouf
2019-06-04 18:08:48 +02:00 · 2019-06-04 16:56:24 +02:00 · 2019-06-03 08:16:18 +02:00 · 2019-06-01 17:00:52 +02:00 · 2019-06-01 16:27:26 +02:00 · 2019-06-01 16:25:29 +02:00
174 changed files with 8413 additions and 544 deletions
--- a/.add_to_list.c.swo
+++ b/.add_to_list.c.swo
--- a/.gitignore
+++ b/.gitignore
@@ -5,3 +5,11 @@ objs/
 a\.out\.dSYM/

 a\.out
+
+*.swo
+
+*.swp
+
+fillit
+
+\.DS_Store
--- a/.parse_input.c.swp
+++ b/.parse_input.c.swp
--- a/.test_mask.c.swp
+++ b/.test_mask.c.swp
--- a/61
+++ b/61
@@ -6,43 +6,50 @@
 #    By: vmanzoni <vmanzoni@student.42.fr>          +#+  +:+       +#+         #
 #                                                 +#+#+#+#+#+   +#+            #
 #    Created: 2019/03/01 13:24:35 by vmanzoni          #+#    #+#              #
-#    Updated: 2019/04/16 14:05:39 by hulamy           ###   ########.fr        #
+#    Updated: 2019/06/01 16:57:51 by hulamy           ###   ########.fr        #
 #                                                                              #
 # **************************************************************************** #

-NAME	=	fillit
+# - - - - - - - - - - - - - - - #
+#          VARIABLES            #
+# - - - - - - - - - - - - - - - #

-OBJ_DIR	=	./
-HEADER	=	./
+NAME = fillit
+CC = gcc

-SRCS	=	*.c
-OBJS	=	$(SRCS:.c=.o)
-LIB	=	fillit.h
+CFLAGS = -I.
+CFLAGS += -Wall -Wextra -Werror

-CC	=	gcc
-CFLAGS	=	-Wall -Werror -Wextra
+LDFLAGS = -L./libft/
+LDLIBS = -lft

-RM	=	rm -rf
+SRCS = $(shell find . -depth 1 -type f -not -name '.*' -not -name 'test*' -name '*.c')

-all:	$(NAME)
+TRASH = $(shell find . -depth 1 -name '*.dSYM')
+TRASH += $(shell find . -depth 1 -type f -name '*.o')
+TRASH += $(shell find . -depth 1 -type f -name '*.swp')
+TRASH += $(shell find . -depth 1 -type f -name '*.swo')
+TRASH += $(shell find . -depth 1 -type f -name '*.swn')

-$(NAME):
-	make -C libft/
-	$(CC) $(CFLAGS) -I$(HEADER) -c $(SRCS)
-	$(CC) -o $(NAME) $(OBJS) -L libft/ -lft
-	#$(CC) $(CFLAGS) -I$(HEADER) -c $(addprefix $(SRC_DIR), $(SRCS))
-	#$(CC) $(OBJS) -o $(NAME)
-	mkdir $(OBJ_DIR)
-	mv $(OBJS) $(OBJ_DIR)
+# - - - - - - - - - - - - - - - #
+#          RULES                #
+# - - - - - - - - - - - - - - - #
+
+all: $(NAME)
+
+$(NAME): $(SRCS)
+	$(CC) $(CFLAGS) $(LDFLAGS) $(LDLIBS) $(SRCS) -o $(NAME)
+
+debug: $(SRCS)
+	$(CC) -g $(CFLAGS) $(LDFLAGS) $(LDLIBS) $(SRCS) -o $(NAME)
+
+lib:
+	make -C ./libft/

 clean:
-	make -C libft/ clean
-	$(RM) $(OBJ_DIR)
+	/bin/rm -rf $(TRASH)

-fclean:	clean
-	make -C libft/ fclean
-	$(RM) $(NAME)
+fclean: clean
+	/bin/rm -rf $(NAME)

-re:	fclean all
-
-.PHONY: all clean fclean re
+re: fclean all
--- a/README.md
+++ b/README.md
@@ -1,20 +1,24 @@
 # Fillit

-**hulamy** and **vmanzoni**
+Team: **hulamy** and **vmanzoni**
+
+Le but de ce projet est d’agencer les Tetriminos entre eux pour former le plus petit carré possible, sachant que ce carré peut présenter des trous quand les pièces données ne s’emboîtent pas parfaitement.

 ## To do

 - [x] Check if we have a file
 - [x] Read file
 - [x] Check if there are errors in file
-  - At least 1 tetrimino or less than 26
 - [x] Check if every tetrimino is valid
-  - 4 char * 4 lines
-  - 4 blocks in 1 tetrimino
-  - No solo block
 - [x] Transform file into tetriminos
- [ ] Backtracking for smallest square
- [ ] Transform tetriminos to letters
- [ ] Print result
+- [x] Backtracking for smallest square
+- [x] Transform tetriminos to letters
+- [x] Print result (Can be done with above step)
+- [ ] Free everything (NO LEAKS)

- [ ] Optimisation
+## BONUS
+- [x] Best error handler (more details on why there is an error.)
+- [x] Optimisation (skip when tetri with same shape was already tested on map)
+- [x] Add colors to tetri when printing result map
+- [x] Flag for debbuging (print every step in backtracking)
+- [x] Adding flags (and password for blocking more args on moulinette)
--- a/add_to_list.c
+++ b/add_to_list.c
@@ -1,152 +0,0 @@
-/* ************************************************************************** */
-/*                                                                            */
-/*                                                        :::      ::::::::   */
-/*   add_to_list.c                                      :+:      :+:    :+:   */
-/*                                                    +:+ +:+         +:+     */
-/*   By: hulamy <hulamy@student.42.fr>              +#+  +:+       +#+        */
-/*                                                +#+#+#+#+#+   +#+           */
-/*   Created: 2019/04/14 15:20:53 by hulamy            #+#    #+#             */
-/*   Updated: 2019/04/18 01:33:00 by hulamy           ###   ########.fr       */
-/*                                                                            */
-/* ************************************************************************** */
-
-#include "fillit.h"
-#include <stdio.h>
-
-/*
-** Function that fills the char **tetraminos section of the structure
-** with the most little rectangle that fit the tetraminos
-*/
-
-char	**fill_tetraminos(char **square, int *tab)
-{
-	char	**result;
-	int		height;
-	int		length;
-	int		i;
-	int		j;
-
-	i = 0;
-	height = tab[2] - tab[0] + 1;
-	length = tab[3] - tab[1] + 1;
-	if (!(result = (char**)malloc(sizeof(*result) * (height + 1))))
-		return (NULL);
-	while (i < height)
-	{
-		if (!(result[i] = (char*)malloc(sizeof(**result) * (length + 1))))
-			return (NULL);
-		result[i][length] = '\0';
-		i++;
-	}
-	i = -1;
-	while (++i < height && (j = -1))
-		while (++j < length)
-			result[i][j] = square[tab[0] + i][tab[1] + j];
-	return (result);
-}
-
-/*
-** This function calculate the line and columns where the tetraminos
-** start and end, by skipping the empty lines
-**
-** ! it has a little bug so far, i need to fix it
-*/
-
-void	find_start_and_end(char **square, int **x)
-{
-	int i;
-
-	x[0][0] = -1;
-	x[0][1] = -1;
-	x[0][2] = 4;
-	x[0][3] = 4;
-	i = 4;
-	while (x[0][0] < 4 && i == 4 && !(i = 0) && square[++(x[0][0])][0] != '#')
-		while (i < 4 && square[*(x[0])][i] != '#')
-			i++;
-	i = 4;
-	while (x[0][1] < 4 && i == 4 && !(i = 0) && square[0][++(x[0][1])] != '#')
-		while (i < 4 && square[i][x[0][1]] != '#')
-			i++;
-	i = -1;
-	while (x[0][2] >= 0 && i == -1 && (i = 3) && square[--(x[0][2])][3] != '#')
-		while (i >= 0 && square[x[0][2]][i] != '#')
-			i--;
-	i = -1;
-	while (x[0][3] >= 0 && i == -1 && (i = 3) && square[3][--(x[0][3])] != '#')
-		while (i >= 0 && square[i][x[0][3]] != '#')
-			i--;
-}
-
-/*
-** this function first call find_start_and_end to find the coordinates
-** of start en end of the most little rectangle that fit the tetraminos
-**
-** it allows it to fill the structure with the size information
-** (for instance :
-** "##" ".#" ".#"
-** is a tatraminos of 2 by 3)
-** then it fills also the area information (2 * 3 = 6)
-**
-** and finally it calls fill_tetraminos to fill the char **tetraminos
-*/
-
-int		fill_list(char **square, t_fillist *list)
-{
-	int	*tab;
-
-	tab = (int*)malloc(sizeof(int) * 4);
-	find_start_and_end(square, &tab);
-	list->size[0] = tab[3] - tab[1] + 1;
-	list->size[1] = tab[2] - tab[0] + 1;
-	list->area = list->size[0] * list->size[1];
-	list->tetraminos = fill_tetraminos(square, tab);
-	return (1);
-}
-
-/*
-** this function first checks if the structure has been created
-** if not, it creates the first element, else it adds an element
-** and modifies the initial pointer to link to the new first element
-**
-** then it calls fill_list to fill the data of the structure
-*/
-
-int		add_to_list(char **square, t_fillist **list)
-{
-	t_fillist	*tmp;
-
-	if (!(tmp = (t_fillist*)malloc(sizeof(*tmp))))
-		return (0);
-	if (!(*list))
-		tmp->next = NULL;
-	else
-		tmp->next = *list;
-	*list = tmp;
-	fill_list(square, *list);
-	return (1);
-}
-
-/*
-**int		main(int ac, char **av)
-**{
-**	static t_fillist	*list = NULL;	// avant d'appeller add_to_list il faut declarer un pointeur static vers la structure
-**	int					i;
-**
-**	if (ac > 1)
-**	{
-**		add_to_list(++av, &list);		// l'appel de la fonction se fait avec un carre valide de 4*4 et l'adresse du pointeur vers la liste
-**		if (ac == 9)
-**			add_to_list(av += 4, &list);
-**		while (list && (i = -1))
-**		{
-**			while (++i < list->size[1])
-**				printf("%s\n", list->tetraminos[i]);
-**			printf("\n");
-**			list = list->next;
-**		}
-**	}
-**
-**	return (0);
-**}
-*/
--- a/f_bonus_opti.c
+++ b/f_bonus_opti.c
@@ -0,0 +1,106 @@
+/* ************************************************************************** */
+/*                                                                            */
+/*                                                        :::      ::::::::   */
+/*   bonus.c                                            :+:      :+:    :+:   */
+/*                                                    +:+ +:+         +:+     */
+/*   By: hulamy <marvin@42.fr>                      +#+  +:+       +#+        */
+/*                                                +#+#+#+#+#+   +#+           */
+/*   Created: 2019/05/24 14:42:46 by hulamy            #+#    #+#             */
+/*   Updated: 2019/06/01 14:11:32 by hulamy           ###   ########.fr       */
+/*                                                                            */
+/* ************************************************************************** */
+
+#include "fillit.h"
+
+/*
+** Test optimisation for not testing wrong maps when tetri are identical
+*/
+
+int			check_tetri_memory(t_fillist *list, int pos)
+{
+	t_fillist		*tetri;
+	unsigned int	mask;
+
+	tetri = list;
+	mask = 1 << ((pos % 32) - 1);
+	if (!tetri->same && !tetri->memory)
+		return(1);
+	if (tetri->same)
+	{
+		if (!(tetri->same->memory[pos / 32] & mask))
+			return (tetri->same->memory[pos / 32] |= mask);
+	}
+	else if (tetri->memory)
+	{
+		if (!(tetri->memory[pos / 32] & mask))
+			return (tetri->memory[pos / 32] |= mask);
+	}
+	return (0);
+}
+
+/*
+** Test optimisation for not testing wrong maps when tetri are identical
+*/
+
+int			compare_tetri(t_fillist *tetri_a, t_fillist *tetri_b)
+{
+	if (tetri_a->same)
+		return (0);
+	if (tetri_a->tetribit != tetri_b->tetribit)
+		return (0);
+	if (tetri_a->width != tetri_b->width)
+		return (0);
+	if (tetri_a->height != tetri_b->height)
+		return (0);
+	return (1);
+}
+
+/*
+** Function that free the list->memory each time it's malloc
+*/
+
+t_fillist	*clean_list_memory(t_fillist *list, t_fillist *tmp)
+{
+	while (tmp)
+	{
+		if (tmp->memory)
+			free(tmp->memory);
+		tmp = tmp->next;
+	}
+	return (list);
+}
+
+/*
+** Test optimisation for not testing wrong maps when tetri are identical
+*/
+
+int			check_same_tetri(t_fillist *list, int num)
+{
+	t_fillist	*curr_tetri;
+	t_fillist	*next_tetri;
+	int			i;
+
+	curr_tetri = clean_list_memory(list, list);
+	while (curr_tetri != NULL)
+	{
+		next_tetri = curr_tetri->next;
+		while (next_tetri != NULL)
+		{
+			if (compare_tetri(curr_tetri, next_tetri))
+			{
+				i = 0;
+				if (!(curr_tetri->memory =
+					(unsigned int *)malloc(sizeof(*curr_tetri->memory) * num)))
+				return (0);
+				while (i < num)
+					curr_tetri->memory[i++] = 0;
+				next_tetri->same = curr_tetri;
+			}
+			next_tetri = next_tetri->next;
+		}
+		curr_tetri->position = 0;
+		curr_tetri->total_num = num;
+		curr_tetri = curr_tetri->next;
+	}
+	return (0);
+}
--- a/f_bonus_print.c
+++ b/f_bonus_print.c
@@ -0,0 +1,79 @@
+/* ************************************************************************** */
+/*                                                                            */
+/*                                                        :::      ::::::::   */
+/*   f_bonus_print.c                                    :+:      :+:    :+:   */
+/*                                                    +:+ +:+         +:+     */
+/*   By: hulamy <hulamy@student.42.fr>              +#+  +:+       +#+        */
+/*                                                +#+#+#+#+#+   +#+           */
+/*   Created: 2019/05/27 13:46:29 by hulamy            #+#    #+#             */
+/*   Updated: 2019/06/01 16:26:09 by hulamy           ###   ########.fr       */
+/*                                                                            */
+/* ************************************************************************** */
+
+#include "fillit.h"
+
+/*
+** function that print the given tetris if flag p is present
+*/
+
+t_fillist	*print_tetri(t_fillist *list, int num)
+{
+	unsigned int	print;
+	t_fillist		*tmp;
+
+	tmp = list;
+	if (list->dope[2])
+	{
+		check_same_tetri(list, 1);
+		while (tmp)
+		{
+			print = tmp->tetribit;
+			print <<= 16;
+			print_sized_map(&print, tmp->width, tmp->height, tmp->letter);
+			if (tmp->same && list->dope[1])
+			{
+				ft_putstr("same --> ");
+				ft_put_tetri_color(tmp->same->letter);
+				ft_putchar('\n');
+			}
+			if (list->dope[1] && tmp->memory)
+				ft_putendl("have a copy");
+			ft_putchar('\n');
+			tmp->total = num;
+			tmp = tmp->next;
+		}
+	}
+	return (list);
+}
+
+/*
+** function that print the map in binary if flag p is present
+** it returns anyway the size of the map for main to print it
+*/
+
+int			print_binary_map(unsigned int *map, int size, int *dope)
+{
+	size--;
+	if (dope[2])
+	{
+		ft_putendl("result in binary :");
+		print_sized_map(map, size, size, '#');
+		ft_putchar('\n');
+	}
+	free(map);
+	return (size);
+}
+
+/*
+** function that print the flags usage
+*/
+
+int			print_flags_usage(void)
+{
+	ft_putendl("flags usage :");
+	ft_putendl("d : debug print (print the map during the backtracking)");
+	ft_putendl("o : optimisation ultra fast but with some errors still");
+	ft_putendl("p : print the tetri and the map in different formats");
+	ft_putendl("e : error msgs more precise AND no error for too much tetri\n");
+	return (0);
+}
--- a/f_handle_errors.c
+++ b/f_handle_errors.c
@@ -0,0 +1,138 @@
+/* ************************************************************************** */
+/*                                                                            */
+/*                                                        :::      ::::::::   */
+/*   f_handle_errors.c                                  :+:      :+:    :+:   */
+/*                                                    +:+ +:+         +:+     */
+/*   By: vmanzoni <vmanzoni@student.42.fr>          +#+  +:+       +#+        */
+/*                                                +#+#+#+#+#+   +#+           */
+/*   Created: 2019/03/01 13:29:05 by vmanzoni          #+#    #+#             */
+/*   Updated: 2019/06/01 15:53:31 by vmanzoni         ###   ########.fr       */
+/*                                                                            */
+/* ************************************************************************** */
+
+#include "fillit.h"
+
+/*
+** Function that display error message *s on fd and exit program
+*/
+
+void	print_error(char *str)
+{
+	write(1, str, ft_strlen(str));
+	exit(0);
+}
+
+/*
+** Function that display error message *s on fd with more informations
+*/
+
+void	print_error_extended(int error, int *dope)
+{
+	if (!dope[3])
+		print_error("error\n");
+	if (error == 1)
+		print_error("error: File contains char other than '.','#' and '\\n'\n");
+	if (error == 2)
+		print_error("error: File contains two tetriminos not"
+					"separated by a '\\n'\n");
+	if (error == 3)
+		print_error("error: File contains more than 2 '\\n' in a row\n");
+	if (error == 4)
+		print_error("error: File contains less than 1 tetrimino\n");
+	if (error == 5)
+		print_error("error: File contains more than 26 tetriminos\n");
+	if (error == 6)
+		print_error("error: Tetrimino has more or less than 4 #\n");
+	if (error == 7)
+		print_error("error: Tetrimino # are not all connected\n");
+	print_error("error\n");
+}
+
+/*
+** Function to see if there if an error if the file
+** - less than 4 lines
+** - more than 104 (26 tetri) + 25 (\n) = 129 lines
+** - two \n in a row
+*/
+
+void	check_file_errors(char *file, int *dope)
+{
+	int		i;
+	int		line_nbr;
+
+	i = 0;
+	line_nbr = 0;
+	while (file[i])
+	{
+		if (file[i] != '.' && file[i] != '#' && file[i] != '\n')
+			print_error_extended(1, dope);
+		else if (file[i] == '\n')
+			line_nbr++;
+		if (file[i] == '\n' && line_nbr % 5 == 0 && file[i - 1] != '\n')
+			print_error_extended(2, dope);
+		if (file[i] == '\n' && file[i + 1] != '\0' && \
+			file[i + 2] != '.' && file[i + 2] != '#')
+			print_error_extended(3, dope);
+		i++;
+	}
+	if (file[i - 1] == '\n')
+		print_error_extended(3, dope);
+	if (line_nbr < 4)
+		print_error_extended(4, dope);
+	if (!dope[3] && line_nbr > 129)
+		print_error_extended(5, dope);
+}
+
+/*
+** Function that check if tetrimino square contains:
+** - 4 x #
+** - 12 x .
+*/
+
+int		check_tetri_errors(char *tetri)
+{
+	int		i;
+	int		htg;
+	int		dot;
+
+	i = 0;
+	htg = 0;
+	dot = 0;
+	while (tetri[i])
+	{
+		if (tetri[i] == '#')
+			htg++;
+		else if (tetri[i] == '.')
+			dot++;
+		i++;
+	}
+	if (htg != 4 || dot != 12 || check_tetri_errors_proxy(tetri))
+		return (6 + check_tetri_errors_proxy(tetri));
+	return (0);
+}
+
+/*
+** Function that check if 4 # (tetrimino parts) are linked
+*/
+
+int		check_tetri_errors_proxy(char *tetri)
+{
+	int		i;
+	int		j;
+
+	i = 0;
+	j = 0;
+	while (tetri[i])
+	{
+		if (i < 19 && tetri[i] == '#' && tetri[i + 1] == '#')
+			j++;
+		if (i > 0 && tetri[i] == '#' && tetri[i - 1] == '#')
+			j++;
+		if (i < 15 && tetri[i] == '#' && tetri[i + 5] == '#')
+			j++;
+		if (i > 4 && tetri[i] == '#' && tetri[i - 5] == '#')
+			j++;
+		i++;
+	}
+	return ((j < 6) ? 1 : 0);
+}
--- a/f_parse_input.c
+++ b/f_parse_input.c
@@ -0,0 +1,156 @@
+/* ************************************************************************** */
+/*                                                                            */
+/*                                                        :::      ::::::::   */
+/*   parse_input.c                                      :+:      :+:    :+:   */
+/*                                                    +:+ +:+         +:+     */
+/*   By: vmanzoni <vmanzoni@student.42.fr>          +#+  +:+       +#+        */
+/*                                                +#+#+#+#+#+   +#+           */
+/*   Created: 2019/04/15 14:48:14 by vmanzoni          #+#    #+#             */
+/*   Updated: 2019/06/01 13:32:38 by hulamy           ###   ########.fr       */
+/*                                                                            */
+/* ************************************************************************** */
+
+#include "fillit.h"
+
+/*
+** function that transform a tab of . and # into a binary tab of int
+*/
+
+unsigned short	tab_to_bin(char line[])
+{
+	unsigned short	tmp;
+	int				i;
+
+	i = 0;
+	tmp = 0;
+	while (line[i])
+	{
+		tmp <<= 1;
+		if (line[i] == '\n')
+			i++;
+		if (line[i++] == '#')
+			tmp |= 1;
+	}
+	return (tmp);
+}
+
+/*
+** Function that take a tetrimino of 4*4
+** and reduce it to its right size, in binary
+*/
+
+unsigned short	reduce_tetri(unsigned short tetri, int width)
+{
+	unsigned int	mask;
+	unsigned int	tmp;
+
+	mask = ~0u << (32 - width) >> 16;
+	tmp = (mask & tetri);
+	tmp |= ((mask & tetri << 4) >> width);
+	tmp |= ((mask & tetri << 8) >> (2 * width));
+	tmp |= ((mask & tetri << 12) >> (3 * width));
+	return (tmp);
+}
+
+/*
+** Function that transforme a tetriminos char* into a short of 16 bites
+** and then fills it and its reversed into the list
+**
+** 1)	transforme la ligne de . et # en un short de 0 et 1
+** 2)	cree un mask avec des 1 sur la colonne de droite (#...#...#...#...)
+** 3)	utilise le mask pour trouver la largeur que prend le tetriminos
+** 4)	deplace le tetriminos tout en haut a gauche
+** 		(i - list->width = le nombre de colonne vide a gauche)
+** 5)	trouve la hauteur du tetri
+** 6)	fabrique la ligne pour le tetriminos de la bonne largeur
+**
+** list->test is used to debug the backtracking, allowing to print the
+** map each time without the previous tries
+*/
+
+void			fill_list(char line[], t_fillist *list)
+{
+	unsigned int	mask;
+	int				i;
+
+	list->tetribit = tab_to_bin(line);
+	list->memory = 0;
+	mask = (1 << 15) | (1 << 11) | (1 << 7) | (1 << 3);
+	i = 0;
+	while (!(mask & list->tetribit) && i++ < 4)
+		mask >>= 1;
+	list->width = i;
+	while (mask & list->tetribit && ++i < 4)
+		mask >>= 1;
+	list->width = i - list->width;
+	list->tetribit <<= (i - list->width);
+	while (!(list->tetribit & (~0u << 12)))
+		list->tetribit <<= 4;
+	i = 0;
+	while (i < 4 && list->tetribit & (~0u << 28 >> (i * 4 + 16)))
+		i++;
+	list->height = i;
+	list->tetribit = reduce_tetri(list->tetribit, list->width);
+	list->same = NULL;
+	list->test = 0;
+}
+
+/*
+** Function that creates the linked list and add a new structure
+** linked each time needed
+*/
+
+int				add_to_list(char *line, t_fillist **lst, char letter, int *dope)
+{
+	t_fillist	*tmp;
+	t_fillist	*test;
+
+	if (!(tmp = (t_fillist*)malloc(sizeof(*tmp))))
+		return (0);
+	tmp->next = NULL;
+	test = *lst;
+	if (!test)
+		*lst = tmp;
+	else
+	{
+		while (test->next)
+			test = test->next;
+		test->next = tmp;
+	}
+	fill_list(line, tmp);
+	tmp->letter = letter;
+	tmp->dope = dope;
+	tmp->start = *lst;
+	tmp->memory = NULL;
+	return (1);
+}
+
+/*
+** Function that parse a file and put each tetrimino in a linked list
+*/
+
+int				parse_input(char *input, t_fillist **list, int *dope)
+{
+	char				tetri[20];
+	int					i;
+	int					j;
+	int					letter;
+	int					size;
+
+	i = 0;
+	letter = 'A';
+	while (input[i])
+	{
+		j = 0;
+		while (j < 19)
+			tetri[j++] = input[i++];
+		tetri[19] = '\0';
+		if (check_tetri_errors(tetri))
+			print_error_extended(check_tetri_errors(tetri), dope);
+		add_to_list(tetri, list, letter++, dope);
+		while (input[i] && input[i] != '.' && input[i] != '#')
+			i++;
+	}
+	size = search_map(*list);
+	return (size);
+}
--- a/f_print.c
+++ b/f_print.c
@@ -0,0 +1,122 @@
+/* ************************************************************************** */
+/*                                                                            */
+/*                                                        :::      ::::::::   */
+/*   f_print.c                                          :+:      :+:    :+:   */
+/*                                                    +:+ +:+         +:+     */
+/*   By: hulamy <hulamy@student.42.fr>              +#+  +:+       +#+        */
+/*                                                +#+#+#+#+#+   +#+           */
+/*   Created: 2019/04/30 13:24:28 by hulamy            #+#    #+#             */
+/*   Updated: 2019/06/01 13:56:50 by hulamy           ###   ########.fr       */
+/*                                                                            */
+/* ************************************************************************** */
+
+#include "fillit.h"
+
+/*
+** Function that print a map of height and width
+** useful to print tetris
+*/
+
+void	print_sized_map(unsigned int *tab, int width, int height, char letter)
+{
+	int				i;
+	unsigned int	mask;
+
+	i = 0;
+	mask = 0;
+	while (i++ < width)
+		mask = (mask >> 1) | ((mask | 1) << 31);
+	i = 0;
+	while (i < width * height)
+	{
+		if (i && !(i % width))
+			ft_putchar('\n');
+		if (tab[i / 32] & (1 << (31 - i % 32)))
+			ft_put_tetri_color(letter);
+		else
+			ft_putchar('.');
+		ft_putchar(' ');
+		i++;
+	}
+	write(1, "\n", 1);
+}
+
+/*
+** Print the final map with the letters
+** if flag value is 0 -> print moulinette version
+** if flag value is p -> print in color
+*/
+
+char	*init_print_map(t_fillist *list, int size)
+{
+	char		*map;
+	int			i;
+	int			j;
+
+	if (!(map = (char *)malloc(sizeof(*map) * (size * size + 1))))
+		return (NULL);
+	map[size * size] = '\0';
+	i = -1;
+	while (++i < size * size)
+		map[i] = '.';
+	while (list)
+	{
+		j = 0;
+		i = -1;
+		while (++i < list->width * list->height)
+		{
+			if (i && i % list->width == 0)
+				j += size - list->width;
+			if (1 << (15 - i) & list->tetribit && list->test == 1)
+				map[list->position + i + j - 1] = list->letter;
+		}
+		list = list->next;
+	}
+	return (map);
+}
+
+/*
+** Function that print the map with color if flag = 1
+** or for moulinette if flag = 0;
+*/
+
+void	print_letter_map(t_fillist *list, int size, int flag)
+{
+	int			i;
+	char		*map;
+
+	map = init_print_map(list, size);
+	i = -1;
+	while (++i < size * size)
+	{
+		if (i && i % size == 0)
+			ft_putchar('\n');
+		if (flag == 0)
+			ft_putchar(map[i]);
+		else
+		{
+			ft_put_tetri_color(map[i]);
+			ft_putchar(' ');
+		}
+	}
+	ft_putchar('\n');
+	free(map);
+}
+
+/*
+** Function that print the map
+*/
+
+void	print_final_map(t_fillist *list, int size)
+{
+	if (list->dope[2])
+	{
+		ft_putendl("result for humans :");
+		print_letter_map(list, size, 1);
+		ft_putchar('\n');
+		ft_putendl("result for moulinette :");
+	}
+	print_letter_map(list, size, 0);
+	if (list->dope[2])
+		ft_putchar('\n');
+}
--- a/f_print_map_with_colors.c
+++ b/f_print_map_with_colors.c
@@ -0,0 +1,51 @@
+/* ************************************************************************** */
+/*                                                                            */
+/*                                                        :::      ::::::::   */
+/*   print_map_with_colors.c                            :+:      :+:    :+:   */
+/*                                                    +:+ +:+         +:+     */
+/*   By: vmanzoni <vmanzoni@student.42.fr>          +#+  +:+       +#+        */
+/*                                                +#+#+#+#+#+   +#+           */
+/*   Created: 2019/05/03 20:27:22 by vmanzoni          #+#    #+#             */
+/*   Updated: 2019/06/01 14:27:30 by hulamy           ###   ########.fr       */
+/*                                                                            */
+/* ************************************************************************** */
+
+#include "fillit.h"
+
+void	ft_putchar_color(char c, char color)
+{
+	if (color == 'R')
+		write(1, RED, 5);
+	else if (color == 'B')
+		write(1, BLU, 5);
+	else if (color == 'G')
+		write(1, GRN, 5);
+	else if (color == 'Y')
+		write(1, YEL, 5);
+	else if (color == 'M')
+		write(1, MAG, 5);
+	else if (color == 'C')
+		write(1, CYN, 5);
+	else if (color == 'W' || !c)
+		write(1, RESET, 5);
+	ft_putchar(c);
+	write(1, RESET, 5);
+}
+
+void	ft_put_tetri_color(char c)
+{
+	if (c == 'A' || c == 'G' || c == 'M' || c == 'S' || c == 'Y')
+		ft_putchar_color(c, 'R');
+	else if (c == 'B' || c == 'H' || c == 'N' || c == 'T' || c == 'Z')
+		ft_putchar_color(c, 'B');
+	else if (c == 'C' || c == 'I' || c == 'O' || c == 'U')
+		ft_putchar_color(c, 'G');
+	else if (c == 'D' || c == 'J' || c == 'P' || c == 'V')
+		ft_putchar_color(c, 'Y');
+	else if (c == 'E' || c == 'K' || c == 'Q' || c == 'W')
+		ft_putchar_color(c, 'M');
+	else if (c == 'F' || c == 'L' || c == 'R' || c == 'X')
+		ft_putchar_color(c, 'C');
+	else
+		ft_putchar(c);
+}
--- a/f_read_file.c
+++ b/f_read_file.c
@@ -6,7 +6,7 @@
 /*   By: vmanzoni <vmanzoni@student.42.fr>          +#+  +:+       +#+        */
 /*                                                +#+#+#+#+#+   +#+           */
 /*   Created: 2019/04/13 12:09:46 by vmanzoni          #+#    #+#             */
-/*   Updated: 2019/04/15 14:48:36 by vmanzoni         ###   ########.fr       */
+/*   Updated: 2019/06/01 15:12:03 by hulamy           ###   ########.fr       */
 /*                                                                            */
 /* ************************************************************************** */

@@ -18,24 +18,33 @@

 char	*read_file(char *file)
 {
-	char	buf[BUFF_SIZE];
-	int		fd;
-	int		rv;
-	int		i;
-	char	*result;
+	char		buf[BUFF_SIZE];
+	int			fd;
+	int			rv;
+	int			i;
+	char		*result;

 	if (((fd = open(file, O_RDONLY)) < 0) \
 		|| ((rv = read(fd, &buf, BUFF_SIZE)) < 0) \
-		|| !(result =  malloc(sizeof(char) * rv)))
+			|| !(result = malloc(sizeof(char) * rv)))
 		return (NULL);
-	buf[rv] = '\0';
-	i = 0;
-	while (buf[i])
-	{
+	buf[rv - 1] = '\0';
+	i = -1;
+	while (buf[++i])
 		result[i] = buf[i];
-		i++;
-	}
 	result[i] = '\0';
 	close(fd);
 	return (result);
 }
+
+/*
+**	Function that init num and size for search_map
+*/
+
+void	init_num_and_size(int num, int *size, t_fillist *tmp)
+{
+	while ((tmp = tmp->next))
+		num++;
+	while (*size * *size < num * 4)
+		(*size)++;
+}
--- a/f_search_map.c
+++ b/f_search_map.c
@@ -0,0 +1,247 @@
+/* ************************************************************************** */
+/*                                                                            */
+/*                                                        :::      ::::::::   */
+/*   f_search_map.c                                     :+:      :+:    :+:   */
+/*                                                    +:+ +:+         +:+     */
+/*   By: hulamy <hulamy@student.42.fr>              +#+  +:+       +#+        */
+/*                                                +#+#+#+#+#+   +#+           */
+/*   Created: 2019/04/27 20:47:22 by hulamy            #+#    #+#             */
+/*   Updated: 2019/06/01 15:12:08 by hulamy           ###   ########.fr       */
+/*                                                                            */
+/* ************************************************************************** */
+
+#include "fillit.h"
+
+/*
+** function that look if a tretri fit in a place
+*/
+
+unsigned int	fit_in_place(unsigned int *map, t_fillist *lst, int sze, int i)
+{
+	unsigned int	tmp;
+	unsigned int	mask;
+	unsigned int	tetri;
+	int				n;
+	int				r;
+
+	n = lst->num;
+	r = lst->rank;
+	i = lst->height;
+	tetri = lst->tetribit << 16 >> lst->width;
+	tmp = 0;
+	mask = ~0u << (32 - lst->width);
+	while (i--)
+	{
+		if (tmp & tetri)
+			return (0);
+		if (r >= 32 && ++n)
+			r -= 32;
+		tmp = (mask & (map[n] << r));
+		if (n + 1 < lst->total_num)
+			tmp |= (mask & (map[n + 1] >> (32 - r)));
+		tetri <<= lst->width;
+		r += sze;
+	}
+	return (!(tmp & tetri));
+}
+
+/*
+** function that look for the first place in the map for a tetri
+*/
+
+int				find_place(unsigned int *map, t_fillist *list, int size)
+{
+	int	limit;
+	int	pos;
+
+	pos = list->position;
+	list->place = pos % size;
+	list->rank = pos % 32;
+	list->num = pos / 32;
+	limit = (size - list->height + 1) * size;
+	while (pos < limit)
+	{
+		if (list->rank >= 32 && ++list->num)
+			list->rank -= 32;
+		if (list->place > size - list->width)
+		{
+			list->place = -1;
+			pos += list->width - 2;
+			list->rank += list->width - 2;
+		}
+		else if (fit_in_place(map, list, size, 0))
+			return ((list->position = pos + 1));
+		pos++;
+		list->place++;
+		list->rank++;
+	}
+	return (0);
+}
+
+/*
+** function that add or remove a tetri on the map
+*/
+
+void			add_remove(unsigned int *map, t_fillist *list, int size)
+{
+	unsigned int	msk;
+	unsigned short	tetri;
+	int				i;
+	int				j;
+
+	tetri = list->tetribit;
+	msk = ~0u << (32 - list->width);
+	i = (list->height - 1) * list->width;
+	j = (list->height - 1) * size + list->position;
+	while (j >= list->position)
+	{
+		map[(j - 1) / 32] ^= (msk & tetri << (16 + i)) >> (j - 1);
+		if ((j - 1) / 32 + 1 < list->total_num)
+			map[(j - 1) / 32 + 1] ^= (msk & tetri << (16 + i)) << (32 - j) << 1;
+		j -= size;
+		i -= list->width;
+	}
+}
+
+/*
+** Function that try to place every tetri in the left places
+** to know if it worth it to continue to check in this order
+*/
+
+int		check_others(unsigned int *map, t_fillist *list, int size, int num)
+{
+	t_fillist	*tmp;
+	int			dots;
+	int			total;
+	int			i;
+	int			j;
+
+	dots = 0;
+	i = -1;
+	num *= 4;
+	total = size * size;
+	while (++i < total && dots <= total - num)
+	{
+		tmp = list->next;
+		j = 1;
+		while (1 << (i % 32) & map[i % 32])
+			i++;
+		while (j && tmp)
+		{
+			if (tmp->width > (size - i % size) || (total - i) <= (tmp->height * size))
+				tmp = tmp->next;
+			else if (!fit_in_place(map, list, size, i))
+				tmp = tmp->next;
+			else
+				j = 0;
+		}
+		if (j)
+			dots++;
+	}
+	return (dots > total - num);
+}
+
+/*
+** Function that supress the memory of already placed tetri
+** when a next one is placed before them
+** because then they might fit where they already tried
+*/
+
+void	clean_memory(t_fillist *list, int pos, int mem)
+{
+	t_fillist		*tmp;
+	unsigned int	mask;
+
+	tmp = list->start;
+	while (tmp)
+	{
+		if (tmp->memory)
+		{
+			pos = mem;
+			while (pos >= list->position)
+			{
+				mask = ~(1 << ((pos % 32) - 1));
+				tmp->memory[pos / 32] &= mask;
+				pos--;
+			}
+		}
+		tmp = tmp->next;
+	}
+}
+
+/*
+** Function that recursively try to fill the map with the tetris
+*/
+
+int				fill_map(unsigned int *map, t_fillist *list, int size)
+{
+	int	pos;
+
+	if (!list)
+		return (1);
+	pos = list->position;
+	list->position = 0;
+	while (find_place(map, list, size))
+	{
+		if (list->position < pos)
+			clean_memory(list, pos, pos);
+		add_remove(map, list, size);
+		list->test = 1;
+		if (list->dope[0])
+		{
+			print_letter_map(list->start, size, 1);
+			ft_putchar('\n');
+		}
+		if (list->dope[1])
+			if (check_tetri_memory(list, list->position))
+//				if (check_others(map, list, size, list->total))
+					if (fill_map(map, list->next, size))
+						return (1);
+		if (!list->dope[1])
+			if (fill_map(map, list->next, size))
+				return (1);
+		add_remove(map, list, size);
+		list->test = 0;
+	}
+	return (0);
+}
+
+/*
+** Function that send to "fill_map" a map of a certain size
+** and increment its size untill it's solved
+*/
+
+int				search_map(t_fillist *list)
+{
+	t_fillist		*tmp;
+	unsigned int	*map;
+	int				size;
+	int				num;
+	int				i;
+
+	size = 2;
+
+	num = 1;
+	tmp = list;
+	while ((tmp = tmp->next))
+		num++;
+
+	tmp = print_tetri(list, num);
+	init_num_and_size(1, &size, tmp);
+	i = 0;
+	while (!i)
+	{
+		num = (size * size) / 32 + 1;
+		if (!(map = (unsigned int *)malloc(sizeof(*map) * num)))
+			return (0);
+		check_same_tetri(list, num);
+		if (list->dope[2])
+			ft_putnbrendl(size);
+		while (num--)
+			map[num] = 0;
+		i = fill_map(map, list, size++);
+		if (!i)
+			free(map);
+	}
+	return (print_binary_map(map, size, list->dope));
+}
--- a/BIN
+++ b/BIN
--- a/fillit.dSYM/Contents/Info.plist
+++ b/fillit.dSYM/Contents/Info.plist
@@ -0,0 +1,20 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<!DOCTYPE plist PUBLIC "-//Apple Computer//DTD PLIST 1.0//EN" "http://www.apple.com/DTDs/PropertyList-1.0.dtd">
+<plist version="1.0">
+	<dict>
+		<key>CFBundleDevelopmentRegion</key>
+		<string>English</string>
+		<key>CFBundleIdentifier</key>
+		<string>com.apple.xcode.dsym.fillit</string>
+		<key>CFBundleInfoDictionaryVersion</key>
+		<string>6.0</string>
+		<key>CFBundlePackageType</key>
+		<string>dSYM</string>
+		<key>CFBundleSignature</key>
+		<string>????</string>
+		<key>CFBundleShortVersionString</key>
+		<string>1.0</string>
+		<key>CFBundleVersion</key>
+		<string>1</string>
+	</dict>
+</plist>
--- a/fillit.h
+++ b/fillit.h
@@ -6,47 +6,140 @@
 /*   By: vmanzoni <vmanzoni@student.42.fr>          +#+  +:+       +#+        */
 /*                                                +#+#+#+#+#+   +#+           */
 /*   Created: 2019/03/01 13:34:46 by vmanzoni          #+#    #+#             */
-/*   Updated: 2019/04/15 20:53:57 by vmanzoni         ###   ########.fr       */
+/*   Updated: 2019/06/01 15:12:00 by hulamy           ###   ########.fr       */
 /*                                                                            */
 /* ************************************************************************** */

 #ifndef FILLIT_H
 # define FILLIT_H

-#include <stdlib.h>
-#include <unistd.h> // for system call write
-#include <fcntl.h> // for system call open
-#include <string.h> // for memmove and strlen
-#include <stdio.h> // for debug printf
-#include <stdbool.h> // to use bool type
+# include <stdlib.h>
+# include <unistd.h>
+# include <fcntl.h>
+# include <stdbool.h>
+
+# include "libft/includes/libft.h"
+
+/*
+** DEFINE
+*/

 # define BUFF_SIZE 1024

+# define RED   "\x1B[31m"
+# define GRN   "\x1B[32m"
+# define YEL   "\x1B[33m"
+# define BLU   "\x1B[34m"
+# define MAG   "\x1B[35m"
+# define CYN   "\x1B[36m"
+# define RESET "\x1B[0m"
+
 /*
 **	STRUCTURE
+** tetribit : tetri ecrit en binaire dans un short de 16 bits
+** width    : largeur du tetri
+** height   : hauteur du tetri
+** position : memorise la position d tetri bit a bit
+** place    : position sur l'axe des abscisses de la map (position % size)
+** rank     : position de 1 a 32 dans l'int du tableau d'int (position % 32)
+** num      : memorise dans quel int du tableau on se trouve (position / 32)
+** total_num: memorise le nombre d'int dans le tableau
+** test     :
+** letter   : letter of the tetrimino for printing final map
+** dope     : flags for details, optimisation, printing and error
+** memory   : positions already tested by a tetrimino in bitwise
+** same     : pointer to previous identical tetrimino
+** next     : pointer to next tetrimino
+** start    : pointer to first tetrimino of input file
 */
-
-typedef struct			s_fillist
+typedef struct	s_fillist
 {
-	int					id;
-	char				**tetraminos;
-	int					position[2];
-	int					size[2];
-	int					area;
+	unsigned short		tetribit;
+	int					width;
+	int					height;
+	int					position;
+	int					place;
+	int					rank;
+	int					num;
+	int					total_num;
+	int					test;
+	int					total;
+	char				letter;
+	int					*dope;
+	unsigned int		*memory;
+	struct s_fillist	*same;
 	struct s_fillist	*next;
-}						t_fillist;
+	struct s_fillist	*start;
+}				t_fillist;

 /*
-**	FUNCTIONS
+**	bonus_opti.c
 */
+int				check_tetri_memory(t_fillist *list, int pos);
+int				compare_tetri(t_fillist *tetri_a, t_fillist *tetri_b);
+t_fillist		*clean_list_memory(t_fillist *list, t_fillist *tmp);
+int				check_same_tetri(t_fillist *list, int num);

-void	print_test(char *test); //DELETE BEFORE EVALUATION
-char	*read_file(char *file);
-void	print_error(char *s);
-void	parse_input(char *input);
-int		check_file_errors(char *file);
-int		check_tetri_errors(char *tetri);
-int		check_tetri_errors2(char *tetri);
-int		add_to_list(char **square, t_fillist **list);
+/*
+**	bonus_print.c
+*/
+t_fillist		*print_tetri(t_fillist *list, int num);
+int				print_binary_map(unsigned int *map, int size, int *dope);
+int				print_flags_usage(void);
+
+/*
+**	main.c
+*/
+int				*create_dope(char *av, int mdp);
+int				is_mdp(int ac, char **av);
+void			clean_list(t_fillist *list, t_fillist *tmp);
+int				main(int argc, char **argv);
+
+/*
+**	read_file.c
+*/
+char			*read_file(char *file);
+void			init_num_and_size(int num, int *size, t_fillist *tmp);
+
+/*
+**	handle_errors.c
+*/
+void			print_error(char *s);
+void			print_error_extended(int error, int *dope);
+void			check_file_errors(char *file, int *dope);
+int				check_tetri_errors(char *tetri);
+int				check_tetri_errors_proxy(char *tetri);
+
+/*
+**	parse_input.c
+*/
+unsigned short	tab_to_bin(char line[]);
+unsigned short	reduce_tetri(unsigned short tetri, int width);
+void			fill_list(char line[], t_fillist *list);
+int				add_to_list(char *sqr, t_fillist **lst, char lett, int *dope);
+int				parse_input(char *input, t_fillist **list, int *dope);
+
+/*
+**	search_map.c
+*/
+unsigned int	fit_in_place(unsigned int *map, t_fillist *lst, int siz, int i);
+int				find_place(unsigned int *map, t_fillist *list, int size);
+void			add_remove(unsigned int *map, t_fillist *list, int size);
+int				fill_map(unsigned int *map, t_fillist *list, int size);
+int				search_map(t_fillist *list);
+
+/*
+**	print.c
+*/
+void			print_sized_map(unsigned int *tab, int wdth, int hgt, char ltr);
+char			*init_print_map(t_fillist *list, int size);
+void			print_letter_map(t_fillist *list, int size, int flag);
+void			print_final_map(t_fillist *list, int size);
+
+/*
+**	print_map_with_colors.c
+*/
+void			ft_putchar_color(char c, char color);
+void			ft_put_tetri_color(char c);

 #endif
--- a/handle_errors.c
+++ b/handle_errors.c
@@ -1,103 +0,0 @@
-/* ************************************************************************** */
-/*                                                                            */
-/*                                                        :::      ::::::::   */
-/*   handle_errors.c                                    :+:      :+:    :+:   */
-/*                                                    +:+ +:+         +:+     */
-/*   By: vmanzoni <vmanzoni@student.42.fr>          +#+  +:+       +#+        */
-/*                                                +#+#+#+#+#+   +#+           */
-/*   Created: 2019/03/01 13:29:05 by vmanzoni          #+#    #+#             */
-/*   Updated: 2019/04/15 14:41:19 by vmanzoni         ###   ########.fr       */
-/*                                                                            */
-/* ************************************************************************** */
-
-#include "fillit.h"
-
-/*
-** Function that display error message *s on fd and exit program
-*/
-
-void	print_error(char *s)
-{
-	write(2, s, strlen(s));
-	exit(1);
-}
-
-/*
-** Function to see if there if an error if the file
-** - less than 4 lines
-** - more than 104 (26 tetri) + 25 (\n) = 129 lines
-** - two \n in a row
-*/
-
-int		check_file_errors(char *file)
-{
-	int		i;
-	int		line_nbr;
-
-	i = 0;
-	line_nbr = 0;
-	while (file[i])
-	{
-		if (file[i] != '.' && file[i] != '#' && file[i] != '\n')
-			return (1);
-		if (file[i] == '\n')
-			line_nbr++;
-		if (file[i] == '\n' && file[i+1] != '\0' && \
-			file[i+2] != '.' && file[i+2] != '#')
-			return (1);
-		i++;
-	}
-	if (line_nbr < 4 || line_nbr > 129)
-		return (1);
-	return (0);
-}
-
-/*
-** Function that check if tetrimino square contains:
-** - 4 '#'
-** - 12 '.'
-*/
-
-int		check_tetri_errors(char *tetri)
-{
-	int		i;
-	int		htg;
-	int		dot;
-
-	i = 0;
-	htg = 0;
-	dot = 0;
-	while (tetri[i])
-	{
-		if (tetri[i] == '#')
-			htg++;
-		else if (tetri[i] == '.')
-			dot++;
-		i++;
-	}
-	if (htg != 4 || dot != 12 || check_tetri_errors2(tetri))
-		return (1);
-	return (0);
-}
-
-/*
-** Function that check if tetrimino parts are linked
-*/
-
-int		check_tetri_errors2(char *tetri)
-{
-	int		i;
-
-	i = 0;
-	while (tetri[i])
-	{
-		if (tetri[i] == '.' || tetri[i] == '\n')
-			i++;
-		else if (tetri[i] == '#' && (tetri[i + 1] == '#' || tetri[i - 1] == '#'
-				|| tetri[i + 5] == '#' || tetri[i - 5] == '#'))
-			i++;
-		else
-			return (1);
-	}
-	return (0);
-}
--- a/1
+++ b/1
--- a/libft/Makefile
+++ b/libft/Makefile
@@ -0,0 +1,223 @@
+##
+# # ------------------------------------------------------
+# # utiliser le makefile pour creer une librairie statique
+# # ------------------------------------------------------
+##
+##
+## - - - - - - - -
+## compiler des .o
+## - - - - - - - -
+##
+##
+## quand on ecrit un programme il contient un main et les
+## fonctions dont le main a besoin (ex ft_putchar) :
+##
+### #include <unistd.h>
+###
+###	void	ft_putchar(char c)
+###	{
+###		write(1, &c, 1);
+###	}
+###
+### int		main()
+### {
+###		ft_putchar('0');
+###		return (0);
+###	}
+##
+## on peut compiler ce fichier avec gcc en faisant :
+## gcc file.c
+## et ca sort un executable a.out
+## si on l'execute "./a.out" ca ecrit 0 dans la console
+##
+## mais pour ne pas reecrire a chaque fois ft_putchar
+## on peut la mettre dans une librairie qu'on inclue dans
+## le fichier qui l'utilise...
+## si on sort ft_putchar du fichier :
+##
+### int		main()
+### {
+###		ft_putchar('0');
+###		return (0);
+###	}
+##
+## et qu'on l'execute "gcc file.c" on va avoir une erreur
+## car file.c utilise ft_putchar mais gcc ne sait pas ce
+## que c'est, donc il faut qu'on le rajoute a la compilation
+## on peut par exemple l'ecrire dans un fichier ft_putchar.c
+##
+### #include <unistd.h>
+###
+###	void	ft_putchar(char c)
+###	{
+###		write(1, &c, 1);
+###	}
+##
+## et compiler les deux :
+## gcc file.c ft_putchar.c
+##
+## ca fonctionne mais gcc doit a chaque fois recompiler
+## ft_putchar.c alors qu'il n'est pas modifie, donc on peut
+## le compiler une bonne fois pour toute et le rajouter a la
+## compilation finale quand on en a besoin sans que l'ordi
+## ait a tout retraduire dans son langage
+##
+## mais si on essaye de compiler ft_putchar seul
+## gcc ft_putchar.c
+## ca nous donne une erreur car pour compiler, gcc a besoin
+## de trouver un main !
+##
+## on va donc utiliser l'option -c pour
+## creer une fichier objet .o qui est deja traduit en langue
+## d'ordinateur et pret a etre rajoute a la compilation :
+## gcc -c ft_putchar.c --> donne ft_putchar.o
+## qu'on peut compiler avec le fichier qui contient le main :
+##
+## gcc file.c ft_putchar.o
+##
+## on a nos bouts de codes comme ft_putchar.o dans des fichiers
+## objets prets a etre ajoutes a la compilation du main
+##
+## on va maintenant voir comment faire une libraire qui contien
+## tous nos fichiers objets
+##
+##
+## - - - - - - - -
+## creer une lib.a
+## - - - - - - - -
+##
+##
+## pour mettre tous les fichiers .o dans un seul fichier .a
+## on utilise un programme d'archive ar avec les options rc
+## r indique d'inserer les .o en remplacant si necessaire
+## c de creer une nouvelle archive
+## le nom de l'archive doit commencer par lib et finir en .a :
+## ar rc nom_de_l'archive fichier_1.o fichier_2.o etc
+##
+## ar rc libtest.a ft_putchar.o
+##
+## on obtient un fichier libtest.a qui contient les fichiers
+## objets .o
+##
+## on peut l'utiliser a la compilation de cette manniere :
+##
+## gcc file.c -L. -ltest
+##
+## -L indique ou est la librairie (ici elle est dans le
+## dossier courant .)
+## -l indique son nom ("test" car on n'indique pas lib et .a)
+##
+##
+# # -----------------------------------------------
+# # ecrire un make file pour aider a la compilation
+# # -----------------------------------------------
+##
+##
+## exemple d'un makefilede basic
+##
+### NAME = libtest.h
+### CC = gcc
+### CFLAGS = -I. -c
+### SRCS = example01.c \
+###        example02.c
+### OBJ = $(SRCS:.c=.o)	|ecrit les fichiers .c en .o
+### 
+### all: $(NAME)				|make execute sa premiere regle NAME
+### $(NAME): $(OBJ)				|NAME execute d'abord OBJ
+### 	ar -rc $@ $<			|
+##
+## Make a des built-in pattern rules :
+## https://www.gnu.org/software/make/manual/html_node/Catalogue-of-Rules.html
+## par exemple pour construire des .o a partir de .c
+## qui sont utilisees par défaut si les variables
+## sont bien nomee (genre CC ou CFLAGS)
+##
+## cependant si on veut mettre les fichiers .o dans un
+## sous-fichier BUILDS il n'y a pas de built-in pattern
+## il faut donc l'ecrire nous-meme :
+##
+### NAME = libtest.h
+### CC = gcc
+### CFLAGS = -I.
+### SRCS = example01.c \
+###        example02.c
+### ODIR = ./builds
+### OBJS = $(addprefix $(ODIR)/, $(SRCS:.c=.o))
+### 
+### all: $(NAME)
+### $(NAME): $(OBJS)
+### 	ar -rc $@ $<
+###
+### $(ODIR)/%.o : %.c
+###		$(COMPILE.c) -o $@ $<
+##
+## cette regle est appellee par $(OBJS) puisque
+## cette variable appelle la regle $(ODIR/file.o)
+##
+## COMPILE est une built-in variable qui execute
+## les regles CC et CFLAGS avec l'option -c
+##
+## %   = "tout"
+## $@  = "la valeur a gauche de :"
+## $<  = "la premiere valeur a droite de :"
+## $^  = "toutes les valeurs a droite de :"
+##
+##
+
+
+# ----------------------------------------------------------- #
+#                                                             #
+# variables modifiables                                       #
+#                                                             #
+# ----------------------------------------------------------- #
+
+NAME = libft.a
+
+DEPS = libft.h
+
+SDIR = ./src
+ODIR = ./build
+IDIR = ./includes
+
+CC = gcc
+CFLAGS = -Wall -Wextra -Werror -I$(IDIR)
+
+
+# ----------------------------------------------------------- #
+#                                                             #
+# ne pas modifier en dessous                                  #
+#                                                             #
+# ----------------------------------------------------------- #
+
+## SUB_SDIR sera utilise pour creer les sous dossiers :
+## avec mkdir -p ODIR/subdir1 ODIR/subdir2 ODIR/subdir3 etc...
+## find $(SDIR) cherche recursivement tous le contenu de SDIR
+## -type d ne trouve que les dossiers, pas les fichiers
+## -mindepth 1 ne liste pas le dossier SDIR
+## subst transform arg1 en arg2 dans arg3
+
+SUB_SDIR = $(shell find $(SDIR) -mindepth 1 -type d)
+SRC = $(shell find $(SDIR) -type f -not -name '.*' -name '*.c')
+OBJ = $(subst $(SDIR), $(ODIR), $(SRC:.c=.o))
+
+all: $(ODIR) $(NAME)
+
+$(ODIR):
+	mkdir -p $(subst $(SDIR), $(ODIR), $(SUB_SDIR))
+
+$(ODIR)/%.o: $(SDIR)/%.c
+	$(COMPILE.c) -o $@ $<
+
+$(NAME): $(OBJ)
+	ar -rc $@ $^
+	@ranlib $@
+
+clean:
+	/bin/rm -rf $(ODIR)
+
+fclean: clean
+	/bin/rm -f $(NAME)
+
+re: fclean all
+
+.PHONY: clean
--- a/libft/includes/libft.h
+++ b/libft/includes/libft.h
@@ -0,0 +1,101 @@
+/* ************************************************************************** */
+/*                                                                            */
+/*                                                        :::      ::::::::   */
+/*   libft.h                                            :+:      :+:    :+:   */
+/*                                                    +:+ +:+         +:+     */
+/*   By: hulamy <marvin@42.fr>                      +#+  +:+       +#+        */
+/*                                                +#+#+#+#+#+   +#+           */
+/*   Created: 2018/11/14 21:22:07 by hulamy            #+#    #+#             */
+/*   Updated: 2019/04/07 14:22:04 by hulamy           ###   ########.fr       */
+/*                                                                            */
+/* ************************************************************************** */
+
+#ifndef LIBFT_H
+# define LIBFT_H
+# include <string.h>
+# include <unistd.h>
+# include <stdlib.h>
+
+int					ft_atoi(const char *str);
+void				ft_bzero(void *s, size_t n);
+int					ft_isalnum(int c);
+int					ft_isalpha(int c);
+int					ft_isascii(int c);
+int					ft_isdigit(int c);
+int					ft_isprint(int c);
+void				*ft_memccpy(void *dst, const void *restrict src,
+					int c, size_t n);
+void				*ft_memchr(const void *s, int c, size_t n);
+int					ft_memcmp(const void *s1, const void *s2, size_t n);
+void				*ft_memcpy(void *dst, const void *src, size_t n);
+void				*ft_memmove(void *dst, const void *src, size_t len);
+void				*ft_memset(void *b, int c, size_t len);
+char				*ft_strcat(char *s1, const char *s2);
+char				*ft_strchr(const char *s, int c);
+int					ft_strcmp(const char *s1, const char *s2);
+char				*ft_strcpy(char *dst, const char *src);
+char				*ft_strdup(const char *s1);
+size_t				ft_strlcat(char *dst, const char *src, size_t size);
+size_t				ft_strlen(const char *str);
+char				*ft_strncat(char *s1, const char *s2, size_t n);
+int					ft_strncmp(const char *s1, const char *s2, size_t n);
+char				*ft_strncpy(char *dst, const char *src, size_t len);
+char				*ft_strnstr(const char *big, const char *little,
+					size_t len);
+char				*ft_strrchr(const char *s, int c);
+char				*ft_strstr(const char *big, const char *little);
+int					ft_tolower(int c);
+int					ft_toupper(int c);
+
+char				*ft_itoa(int n);
+void				*ft_memalloc(size_t size);
+void				ft_memdel(void **ap);
+void				ft_putchar(char c);
+void				ft_putchar_fd(char c, int fd);
+void				ft_putendl(char const *str);
+void				ft_putendl_fd(char const *s, int fd);
+void				ft_putnbr(int nbr);
+void				ft_putnbr_fd(int n, int fd);
+void				ft_putstr(char const *str);
+void				ft_putstr_fd(char const *s, int fd);
+void				ft_strclr(char *s);
+void				ft_strdel(char **as);
+int					ft_strequ(char const *s1, char const *s2);
+void				ft_striter(char *s, void (*f)(char *));
+void				ft_striteri(char *s, void (*f)(unsigned int, char *));
+char				*ft_strjoin(char const *s1, char const *s2);
+char				*ft_strjoinfree(char *s1, char *s2);
+char				*ft_strmap(char const *s, char (*f)(char));
+char				*ft_strmapi(char const *s, char (*f)(unsigned int, char));
+int					ft_strnequ(char const *s1, char const *s2, size_t n);
+char				*ft_strnew(size_t size);
+char				**ft_strsplit(char const *s, char c);
+char				*ft_strsub(char const *s, unsigned int start, size_t len);
+char				*ft_strtrim(char const *s);
+
+typedef struct		s_list
+{
+	void			*content;
+	size_t			content_size;
+	struct s_list	*next;
+}					t_list;
+
+t_list				*ft_lstnew(const void *content, size_t content_size);
+void				ft_lstdelone(t_list **alst, void (*del)(void *, size_t));
+void				ft_lstdel(t_list **alst, void (*del)(void *, size_t));
+void				ft_lstadd(t_list **alst, t_list *n);
+void				ft_lstiter(t_list *lst, void (*f)(t_list *elem));
+t_list				*ft_lstmap(t_list *lst, t_list *(*f)(t_list *elem));
+
+void				ft_putnbrbase(int nbr, char *base);
+int					ft_atoibase(char *str, char *base);
+char				*ft_convertbase(char *nbr, char *base_from, char *base_to);
+char				**ft_strmultisplit(char *str, char *charset);
+int					ft_any(char **tab, int (*f)(char*));
+void				ft_foreach(int *tab, int length, void (*f)(int));
+int					ft_issort(int *tab, int length, int (*f)(int, int));
+int					*ft_arraymap(int *tab, int length, int(*f)(int));
+void				ft_putnbrendl(int n);
+void				ft_putnbrendl_fd(int n, int fd);
+
+#endif
--- a/libft/libft.a
+++ b/libft/libft.a
--- a/libft/src/is/ft_isalnum.c
+++ b/libft/src/is/ft_isalnum.c
@@ -0,0 +1,18 @@
+/* ************************************************************************** */
+/*                                                                            */
+/*                                                        :::      ::::::::   */
+/*   ft_isalnum.c                                       :+:      :+:    :+:   */
+/*                                                    +:+ +:+         +:+     */
+/*   By: hulamy <marvin@42.fr>                      +#+  +:+       +#+        */
+/*                                                +#+#+#+#+#+   +#+           */
+/*   Created: 2018/11/14 21:09:33 by hulamy            #+#    #+#             */
+/*   Updated: 2018/11/14 21:09:37 by hulamy           ###   ########.fr       */
+/*                                                                            */
+/* ************************************************************************** */
+
+#include "libft.h"
+
+int		ft_isalnum(int c)
+{
+	return (ft_isalpha(c) || ft_isdigit(c));
+}
--- a/libft/src/is/ft_isalpha.c
+++ b/libft/src/is/ft_isalpha.c
@@ -0,0 +1,18 @@
+/* ************************************************************************** */
+/*                                                                            */
+/*                                                        :::      ::::::::   */
+/*   ft_isalpha.c                                       :+:      :+:    :+:   */
+/*                                                    +:+ +:+         +:+     */
+/*   By: hulamy <marvin@42.fr>                      +#+  +:+       +#+        */
+/*                                                +#+#+#+#+#+   +#+           */
+/*   Created: 2018/11/14 21:09:44 by hulamy            #+#    #+#             */
+/*   Updated: 2018/11/14 21:09:46 by hulamy           ###   ########.fr       */
+/*                                                                            */
+/* ************************************************************************** */
+
+#include "libft.h"
+
+int		ft_isalpha(int c)
+{
+	return ((c >= 'A' && c <= 'Z') || (c >= 'a' && c <= 'z'));
+}
--- a/libft/src/is/ft_isascii.c
+++ b/libft/src/is/ft_isascii.c
@@ -0,0 +1,18 @@
+/* ************************************************************************** */
+/*                                                                            */
+/*                                                        :::      ::::::::   */
+/*   ft_isascii.c                                       :+:      :+:    :+:   */
+/*                                                    +:+ +:+         +:+     */
+/*   By: hulamy <marvin@42.fr>                      +#+  +:+       +#+        */
+/*                                                +#+#+#+#+#+   +#+           */
+/*   Created: 2018/11/14 21:09:53 by hulamy            #+#    #+#             */
+/*   Updated: 2018/11/14 21:09:55 by hulamy           ###   ########.fr       */
+/*                                                                            */
+/* ************************************************************************** */
+
+#include "libft.h"
+
+int		ft_isascii(int c)
+{
+	return (c >= 0 && c <= 127);
+}
--- a/libft/src/is/ft_isdigit.c
+++ b/libft/src/is/ft_isdigit.c
@@ -0,0 +1,18 @@
+/* ************************************************************************** */
+/*                                                                            */
+/*                                                        :::      ::::::::   */
+/*   ft_isdigit.c                                       :+:      :+:    :+:   */
+/*                                                    +:+ +:+         +:+     */
+/*   By: hulamy <marvin@42.fr>                      +#+  +:+       +#+        */
+/*                                                +#+#+#+#+#+   +#+           */
+/*   Created: 2018/11/14 21:10:01 by hulamy            #+#    #+#             */
+/*   Updated: 2018/11/14 21:10:05 by hulamy           ###   ########.fr       */
+/*                                                                            */
+/* ************************************************************************** */
+
+#include "libft.h"
+
+int		ft_isdigit(int c)
+{
+	return (c >= '0' && c <= '9');
+}
--- a/libft/src/is/ft_isprint.c
+++ b/libft/src/is/ft_isprint.c
@@ -0,0 +1,18 @@
+/* ************************************************************************** */
+/*                                                                            */
+/*                                                        :::      ::::::::   */
+/*   ft_isprint.c                                       :+:      :+:    :+:   */
+/*                                                    +:+ +:+         +:+     */
+/*   By: hulamy <marvin@42.fr>                      +#+  +:+       +#+        */
+/*                                                +#+#+#+#+#+   +#+           */
+/*   Created: 2018/11/14 21:10:19 by hulamy            #+#    #+#             */
+/*   Updated: 2018/11/14 21:10:20 by hulamy           ###   ########.fr       */
+/*                                                                            */
+/* ************************************************************************** */
+
+#include "libft.h"
+
+int		ft_isprint(int c)
+{
+	return (c >= 32 && c < 127);
+}
--- a/libft/src/is/ft_issort.c
+++ b/libft/src/is/ft_issort.c
@@ -0,0 +1,26 @@
+/* ************************************************************************** */
+/*                                                                            */
+/*                                                        :::      ::::::::   */
+/*   ft_issort.c                                        :+:      :+:    :+:   */
+/*                                                    +:+ +:+         +:+     */
+/*   By: hulamy <marvin@42.fr>                      +#+  +:+       +#+        */
+/*                                                +#+#+#+#+#+   +#+           */
+/*   Created: 2018/11/16 15:18:14 by hulamy            #+#    #+#             */
+/*   Updated: 2018/11/16 15:18:15 by hulamy           ###   ########.fr       */
+/*                                                                            */
+/* ************************************************************************** */
+
+#include "libft.h"
+
+int		ft_issort(int *tab, int length, int (*f)(int, int))
+{
+	int i;
+
+	i = -1;
+	if (!tab)
+		return (0);
+	while (++i < length - 1)
+		if (f(tab[i], tab[i + 1]) > 0)
+			return (0);
+	return (1);
+}
--- a/libft/src/lst/ft_lstadd.c
+++ b/libft/src/lst/ft_lstadd.c
@@ -0,0 +1,19 @@
+/* ************************************************************************** */
+/*                                                                            */
+/*                                                        :::      ::::::::   */
+/*   ft_lstadd.c                                        :+:      :+:    :+:   */
+/*                                                    +:+ +:+         +:+     */
+/*   By: hulamy <marvin@42.fr>                      +#+  +:+       +#+        */
+/*                                                +#+#+#+#+#+   +#+           */
+/*   Created: 2018/11/14 21:10:33 by hulamy            #+#    #+#             */
+/*   Updated: 2018/11/16 13:58:54 by hulamy           ###   ########.fr       */
+/*                                                                            */
+/* ************************************************************************** */
+
+#include "libft.h"
+
+void	ft_lstadd(t_list **alst, t_list *new)
+{
+	new->next = *alst;
+	*alst = new;
+}
--- a/libft/src/lst/ft_lstdel.c
+++ b/libft/src/lst/ft_lstdel.c
@@ -0,0 +1,20 @@
+/* ************************************************************************** */
+/*                                                                            */
+/*                                                        :::      ::::::::   */
+/*   ft_lstdel.c                                        :+:      :+:    :+:   */
+/*                                                    +:+ +:+         +:+     */
+/*   By: hulamy <marvin@42.fr>                      +#+  +:+       +#+        */
+/*                                                +#+#+#+#+#+   +#+           */
+/*   Created: 2018/11/14 21:10:49 by hulamy            #+#    #+#             */
+/*   Updated: 2018/11/16 13:59:10 by hulamy           ###   ########.fr       */
+/*                                                                            */
+/* ************************************************************************** */
+
+#include "libft.h"
+
+void	ft_lstdel(t_list **alst, void (*del)(void *, size_t))
+{
+	if ((*alst)->next)
+		ft_lstdel(&(*alst)->next, del);
+	ft_lstdelone(alst, del);
+}
--- a/libft/src/lst/ft_lstdelone.c
+++ b/libft/src/lst/ft_lstdelone.c
@@ -0,0 +1,20 @@
+/* ************************************************************************** */
+/*                                                                            */
+/*                                                        :::      ::::::::   */
+/*   ft_lstdelone.c                                     :+:      :+:    :+:   */
+/*                                                    +:+ +:+         +:+     */
+/*   By: hulamy <marvin@42.fr>                      +#+  +:+       +#+        */
+/*                                                +#+#+#+#+#+   +#+           */
+/*   Created: 2018/11/14 21:10:59 by hulamy            #+#    #+#             */
+/*   Updated: 2018/11/16 13:59:22 by hulamy           ###   ########.fr       */
+/*                                                                            */
+/* ************************************************************************** */
+
+#include "libft.h"
+
+void	ft_lstdelone(t_list **alst, void (*del)(void *, size_t))
+{
+	del((*alst)->content, (*alst)->content_size);
+	free(*alst);
+	*alst = NULL;
+}
--- a/libft/src/lst/ft_lstiter.c
+++ b/libft/src/lst/ft_lstiter.c
@@ -0,0 +1,22 @@
+/* ************************************************************************** */
+/*                                                                            */
+/*                                                        :::      ::::::::   */
+/*   ft_lstiter.c                                       :+:      :+:    :+:   */
+/*                                                    +:+ +:+         +:+     */
+/*   By: hulamy <marvin@42.fr>                      +#+  +:+       +#+        */
+/*                                                +#+#+#+#+#+   +#+           */
+/*   Created: 2018/11/14 21:11:14 by hulamy            #+#    #+#             */
+/*   Updated: 2018/11/16 14:01:10 by hulamy           ###   ########.fr       */
+/*                                                                            */
+/* ************************************************************************** */
+
+#include "libft.h"
+
+void	ft_lstiter(t_list *lst, void (*f)(t_list *elem))
+{
+	if (!lst)
+		return ;
+	if (lst->next)
+		ft_lstiter(lst->next, f);
+	f(lst);
+}
--- a/libft/src/lst/ft_lstmap.c
+++ b/libft/src/lst/ft_lstmap.c
@@ -0,0 +1,35 @@
+/* ************************************************************************** */
+/*                                                                            */
+/*                                                        :::      ::::::::   */
+/*   ft_lstmap.c                                        :+:      :+:    :+:   */
+/*                                                    +:+ +:+         +:+     */
+/*   By: hulamy <marvin@42.fr>                      +#+  +:+       +#+        */
+/*                                                +#+#+#+#+#+   +#+           */
+/*   Created: 2018/11/14 21:11:20 by hulamy            #+#    #+#             */
+/*   Updated: 2018/11/16 14:01:23 by hulamy           ###   ########.fr       */
+/*                                                                            */
+/* ************************************************************************** */
+
+#include "libft.h"
+
+t_list		*ft_lstmap(t_list *lst, t_list *(*f)(t_list *elem))
+{
+	t_list		*new;
+	t_list		*tmp;
+
+	if (!lst)
+		return (NULL);
+	tmp = f(lst);
+	new = tmp;
+	while (lst->next)
+	{
+		lst = lst->next;
+		if (!(tmp->next = f(lst)))
+		{
+			free(tmp->next);
+			return (NULL);
+		}
+		tmp = tmp->next;
+	}
+	return (new);
+}
--- a/libft/src/lst/ft_lstnew.c
+++ b/libft/src/lst/ft_lstnew.c
@@ -0,0 +1,35 @@
+/* ************************************************************************** */
+/*                                                                            */
+/*                                                        :::      ::::::::   */
+/*   ft_lstnew.c                                        :+:      :+:    :+:   */
+/*                                                    +:+ +:+         +:+     */
+/*   By: hulamy <marvin@42.fr>                      +#+  +:+       +#+        */
+/*                                                +#+#+#+#+#+   +#+           */
+/*   Created: 2018/11/14 21:11:42 by hulamy            #+#    #+#             */
+/*   Updated: 2018/11/16 14:01:36 by hulamy           ###   ########.fr       */
+/*                                                                            */
+/* ************************************************************************** */
+
+#include "libft.h"
+
+t_list	*ft_lstnew(void const *content, size_t content_size)
+{
+	t_list		*lst;
+
+	if (!(lst = (t_list *)malloc(sizeof(*lst))))
+		return (NULL);
+	if (!content)
+	{
+		lst->content = NULL;
+		lst->content_size = 0;
+	}
+	else
+	{
+		if (!(lst->content = malloc(content_size)))
+			return (NULL);
+		ft_memcpy(lst->content, content, content_size);
+		lst->content_size = content_size;
+	}
+	lst->next = NULL;
+	return (lst);
+}
--- a/libft/src/mem/ft_memalloc.c
+++ b/libft/src/mem/ft_memalloc.c
@@ -0,0 +1,27 @@
+/* ************************************************************************** */
+/*                                                                            */
+/*                                                        :::      ::::::::   */
+/*   ft_memalloc.c                                      :+:      :+:    :+:   */
+/*                                                    +:+ +:+         +:+     */
+/*   By: hulamy <marvin@42.fr>                      +#+  +:+       +#+        */
+/*                                                +#+#+#+#+#+   +#+           */
+/*   Created: 2018/11/14 21:11:58 by hulamy            #+#    #+#             */
+/*   Updated: 2019/04/03 15:42:06 by hulamy           ###   ########.fr       */
+/*                                                                            */
+/* ************************************************************************** */
+
+/*
+** allocate size byte of memory and return a pointer to the allocated memory
+*/
+
+#include "libft.h"
+
+void	*ft_memalloc(size_t size)
+{
+	void	*tmp;
+
+	if (!(tmp = malloc(size)))
+		return (NULL);
+	ft_bzero(tmp, size);
+	return (tmp);
+}
--- a/libft/src/mem/ft_memccpy.c
+++ b/libft/src/mem/ft_memccpy.c
@@ -0,0 +1,36 @@
+/* ************************************************************************** */
+/*                                                                            */
+/*                                                        :::      ::::::::   */
+/*   ft_memccpy.c                                       :+:      :+:    :+:   */
+/*                                                    +:+ +:+         +:+     */
+/*   By: hulamy <marvin@42.fr>                      +#+  +:+       +#+        */
+/*                                                +#+#+#+#+#+   +#+           */
+/*   Created: 2018/11/14 21:12:10 by hulamy            #+#    #+#             */
+/*   Updated: 2019/04/03 15:42:41 by hulamy           ###   ########.fr       */
+/*                                                                            */
+/* ************************************************************************** */
+
+/*
+** copy string until character is found and place cursor in dst
+** after last byte copied
+*/
+
+#include "libft.h"
+
+void	*ft_memccpy(void *dst, const void *src, int c, size_t n)
+{
+	unsigned char	*dest;
+	unsigned char	*sourc;
+	size_t			i;
+
+	i = -1;
+	dest = (unsigned char *)dst;
+	sourc = (unsigned char *)src;
+	while (++i < n)
+	{
+		dest[i] = sourc[i];
+		if (sourc[i] == (unsigned char)c)
+			return (dst + i + 1);
+	}
+	return (NULL);
+}
--- a/libft/src/mem/ft_memchr.c
+++ b/libft/src/mem/ft_memchr.c
@@ -0,0 +1,30 @@
+/* ************************************************************************** */
+/*                                                                            */
+/*                                                        :::      ::::::::   */
+/*   ft_memchr.c                                        :+:      :+:    :+:   */
+/*                                                    +:+ +:+         +:+     */
+/*   By: hulamy <marvin@42.fr>                      +#+  +:+       +#+        */
+/*                                                +#+#+#+#+#+   +#+           */
+/*   Created: 2018/11/14 21:12:32 by hulamy            #+#    #+#             */
+/*   Updated: 2019/04/03 15:43:14 by hulamy           ###   ########.fr       */
+/*                                                                            */
+/* ************************************************************************** */
+
+/*
+** locate character in string and return its position
+*/
+
+#include "libft.h"
+
+void	*ft_memchr(const void *s, int c, size_t n)
+{
+	unsigned char	*sbis;
+	size_t			i;
+
+	sbis = (unsigned char *)s;
+	i = -1;
+	while (++i < n)
+		if (sbis[i] == (unsigned char)c)
+			return ((void *)sbis + i);
+	return (NULL);
+}
--- a/libft/src/mem/ft_memcmp.c
+++ b/libft/src/mem/ft_memcmp.c
@@ -0,0 +1,32 @@
+/* ************************************************************************** */
+/*                                                                            */
+/*                                                        :::      ::::::::   */
+/*   ft_memcmp.c                                        :+:      :+:    :+:   */
+/*                                                    +:+ +:+         +:+     */
+/*   By: hulamy <marvin@42.fr>                      +#+  +:+       +#+        */
+/*                                                +#+#+#+#+#+   +#+           */
+/*   Created: 2018/11/14 21:13:04 by hulamy            #+#    #+#             */
+/*   Updated: 2019/04/03 15:43:41 by hulamy           ###   ########.fr       */
+/*                                                                            */
+/* ************************************************************************** */
+
+/*
+** compare two bytes strings (doesnt recognize a null terminated string)
+** and return value of difference between first two different character
+*/
+
+#include "libft.h"
+
+int		ft_memcmp(const void *s1, const void *s2, size_t n)
+{
+	unsigned char	*frst;
+	unsigned char	*scnd;
+	size_t			i;
+
+	i = 0;
+	frst = (unsigned char *)s1;
+	scnd = (unsigned char *)s2;
+	while (i < n && frst[i] == scnd[i])
+		i++;
+	return ((i == n) ? 0 : frst[i] - scnd[i]);
+}
--- a/libft/src/mem/ft_memcpy.c
+++ b/libft/src/mem/ft_memcpy.c
@@ -0,0 +1,31 @@
+/* ************************************************************************** */
+/*                                                                            */
+/*                                                        :::      ::::::::   */
+/*   ft_memcpy.c                                        :+:      :+:    :+:   */
+/*                                                    +:+ +:+         +:+     */
+/*   By: hulamy <marvin@42.fr>                      +#+  +:+       +#+        */
+/*                                                +#+#+#+#+#+   +#+           */
+/*   Created: 2018/11/14 21:13:17 by hulamy            #+#    #+#             */
+/*   Updated: 2019/04/03 15:43:56 by hulamy           ###   ########.fr       */
+/*                                                                            */
+/* ************************************************************************** */
+
+/*
+** copy n characters from src to dst and return dst
+*/
+
+#include "libft.h"
+
+void	*ft_memcpy(void *dst, const void *src, size_t n)
+{
+	size_t	i;
+	char	*ptr;
+	char	*ptr2;
+
+	ptr = (char *)dst;
+	ptr2 = (char *)src;
+	i = -1;
+	while (++i < n)
+		ptr[i] = ptr2[i];
+	return (dst);
+}
--- a/libft/src/mem/ft_memdel.c
+++ b/libft/src/mem/ft_memdel.c
@@ -1,25 +1,26 @@
 /* ************************************************************************** */
 /*                                                                            */
 /*                                                        :::      ::::::::   */
-/*   print_fillit.c                                     :+:      :+:    :+:   */
+/*   ft_memdel.c                                        :+:      :+:    :+:   */
 /*                                                    +:+ +:+         +:+     */
-/*   By: vmanzoni <vmanzoni@student.42.fr>          +#+  +:+       +#+        */
+/*   By: hulamy <marvin@42.fr>                      +#+  +:+       +#+        */
 /*                                                +#+#+#+#+#+   +#+           */
-/*   Created: 2019/03/01 13:35:48 by vmanzoni          #+#    #+#             */
-/*   Updated: 2019/04/15 00:11:22 by hulamy           ###   ########.fr       */
+/*   Created: 2018/11/14 21:13:26 by hulamy            #+#    #+#             */
+/*   Updated: 2019/04/03 15:44:12 by hulamy           ###   ########.fr       */
 /*                                                                            */
 /* ************************************************************************** */

-#include "fillit.h"
-
 /*
-void ft_print_fillit()
-{
-
-}
+** free memory
 */

-void	print_test(char *test)
+#include "libft.h"
+
+void	ft_memdel(void **ap)
 {
-	write(1, test, strlen(test));
+	if (ap && *ap)
+	{
+		free(*ap);
+		*ap = 0;
+	}
 }
--- a/libft/src/mem/ft_memmove.c
+++ b/libft/src/mem/ft_memmove.c
@@ -0,0 +1,35 @@
+/* ************************************************************************** */
+/*                                                                            */
+/*                                                        :::      ::::::::   */
+/*   ft_memmove.c                                       :+:      :+:    :+:   */
+/*                                                    +:+ +:+         +:+     */
+/*   By: hulamy <marvin@42.fr>                      +#+  +:+       +#+        */
+/*                                                +#+#+#+#+#+   +#+           */
+/*   Created: 2018/11/14 21:13:34 by hulamy            #+#    #+#             */
+/*   Updated: 2019/04/03 15:44:28 by hulamy           ###   ########.fr       */
+/*                                                                            */
+/* ************************************************************************** */
+
+/*
+** copy n characters from src to dst in a non destructive way and return dst
+*/
+
+#include "libft.h"
+
+void	*ft_memmove(void *dst, const void *src, size_t len)
+{
+	int		i;
+	char	*source;
+	char	*dest;
+
+	i = -1;
+	source = (char *)src;
+	dest = (char *)dst;
+	if (source < dest)
+		while ((int)(--len) >= 0)
+			dest[len] = source[len];
+	else
+		while (++i < (int)len)
+			dest[i] = source[i];
+	return (dst);
+}
--- a/libft/src/mem/ft_memset.c
+++ b/libft/src/mem/ft_memset.c
@@ -0,0 +1,29 @@
+/* ************************************************************************** */
+/*                                                                            */
+/*                                                        :::      ::::::::   */
+/*   ft_memset.c                                        :+:      :+:    :+:   */
+/*                                                    +:+ +:+         +:+     */
+/*   By: hulamy <marvin@42.fr>                      +#+  +:+       +#+        */
+/*                                                +#+#+#+#+#+   +#+           */
+/*   Created: 2018/11/14 21:13:41 by hulamy            #+#    #+#             */
+/*   Updated: 2019/04/03 15:44:44 by hulamy           ###   ########.fr       */
+/*                                                                            */
+/* ************************************************************************** */
+
+/*
+** copy n time a character in a string and return the string
+*/
+
+#include "libft.h"
+
+void	*ft_memset(void *b, int c, size_t len)
+{
+	char	*ptr;
+	size_t	i;
+
+	ptr = (char *)b;
+	i = 0;
+	while (i < len)
+		ptr[i++] = c;
+	return (b);
+}
--- a/libft/src/put/ft_putchar.c
+++ b/libft/src/put/ft_putchar.c
@@ -1,20 +1,18 @@
 /* ************************************************************************** */
 /*                                                                            */
 /*                                                        :::      ::::::::   */
-/*   get_smallest_square.c                              :+:      :+:    :+:   */
+/*   ft_putchar.c                                       :+:      :+:    :+:   */
 /*                                                    +:+ +:+         +:+     */
-/*   By: vmanzoni <vmanzoni@student.42.fr>          +#+  +:+       +#+        */
+/*   By: hulamy <marvin@42.fr>                      +#+  +:+       +#+        */
 /*                                                +#+#+#+#+#+   +#+           */
-/*   Created: 2019/04/12 22:29:45 by vmanzoni          #+#    #+#             */
-/*   Updated: 2019/04/14 21:37:19 by vmanzoni         ###   ########.fr       */
+/*   Created: 2018/11/14 21:14:00 by hulamy            #+#    #+#             */
+/*   Updated: 2018/11/14 21:14:01 by hulamy           ###   ########.fr       */
 /*                                                                            */
 /* ************************************************************************** */

-#include "fillit.h"
+#include "libft.h"

-/*
-char	*get_smallest_square()
+void	ft_putchar(char c)
 {
-
+	write(1, &c, 1);
 }
-*/
--- a/libft/src/put/ft_putchar_fd.c
+++ b/libft/src/put/ft_putchar_fd.c
@@ -0,0 +1,18 @@
+/* ************************************************************************** */
+/*                                                                            */
+/*                                                        :::      ::::::::   */
+/*   ft_putchar_fd.c                                    :+:      :+:    :+:   */
+/*                                                    +:+ +:+         +:+     */
+/*   By: hulamy <marvin@42.fr>                      +#+  +:+       +#+        */
+/*                                                +#+#+#+#+#+   +#+           */
+/*   Created: 2018/11/14 21:14:14 by hulamy            #+#    #+#             */
+/*   Updated: 2018/11/14 21:14:15 by hulamy           ###   ########.fr       */
+/*                                                                            */
+/* ************************************************************************** */
+
+#include "libft.h"
+
+void	ft_putchar_fd(char c, int fd)
+{
+	write(fd, &c, 1);
+}
--- a/libft/src/put/ft_putendl.c
+++ b/libft/src/put/ft_putendl.c
@@ -0,0 +1,19 @@
+/* ************************************************************************** */
+/*                                                                            */
+/*                                                        :::      ::::::::   */
+/*   ft_putendl.c                                       :+:      :+:    :+:   */
+/*                                                    +:+ +:+         +:+     */
+/*   By: hulamy <marvin@42.fr>                      +#+  +:+       +#+        */
+/*                                                +#+#+#+#+#+   +#+           */
+/*   Created: 2018/11/14 21:14:32 by hulamy            #+#    #+#             */
+/*   Updated: 2018/11/14 21:14:33 by hulamy           ###   ########.fr       */
+/*                                                                            */
+/* ************************************************************************** */
+
+#include "libft.h"
+
+void	ft_putendl(char const *s)
+{
+	ft_putstr(s);
+	ft_putchar('\n');
+}
--- a/libft/src/put/ft_putendl_fd.c
+++ b/libft/src/put/ft_putendl_fd.c
@@ -0,0 +1,19 @@
+/* ************************************************************************** */
+/*                                                                            */
+/*                                                        :::      ::::::::   */
+/*   ft_putendl_fd.c                                    :+:      :+:    :+:   */
+/*                                                    +:+ +:+         +:+     */
+/*   By: hulamy <marvin@42.fr>                      +#+  +:+       +#+        */
+/*                                                +#+#+#+#+#+   +#+           */
+/*   Created: 2018/11/14 21:14:47 by hulamy            #+#    #+#             */
+/*   Updated: 2018/11/14 21:14:48 by hulamy           ###   ########.fr       */
+/*                                                                            */
+/* ************************************************************************** */
+
+#include "libft.h"
+
+void	ft_putendl_fd(char const *s, int fd)
+{
+	ft_putstr_fd(s, fd);
+	ft_putchar_fd('\n', fd);
+}
--- a/libft/src/put/ft_putnbr.c
+++ b/libft/src/put/ft_putnbr.c
@@ -0,0 +1,18 @@
+/* ************************************************************************** */
+/*                                                                            */
+/*                                                        :::      ::::::::   */
+/*   ft_putnbr.c                                        :+:      :+:    :+:   */
+/*                                                    +:+ +:+         +:+     */
+/*   By: hulamy <marvin@42.fr>                      +#+  +:+       +#+        */
+/*                                                +#+#+#+#+#+   +#+           */
+/*   Created: 2018/11/14 21:14:57 by hulamy            #+#    #+#             */
+/*   Updated: 2018/11/14 21:14:58 by hulamy           ###   ########.fr       */
+/*                                                                            */
+/* ************************************************************************** */
+
+#include "libft.h"
+
+void	ft_putnbr(int n)
+{
+	ft_putnbr_fd(n, 1);
+}
--- a/libft/src/put/ft_putnbr_fd.c
+++ b/libft/src/put/ft_putnbr_fd.c
@@ -0,0 +1,28 @@
+/* ************************************************************************** */
+/*                                                                            */
+/*                                                        :::      ::::::::   */
+/*   ft_putnbr_fd.c                                     :+:      :+:    :+:   */
+/*                                                    +:+ +:+         +:+     */
+/*   By: hulamy <marvin@42.fr>                      +#+  +:+       +#+        */
+/*                                                +#+#+#+#+#+   +#+           */
+/*   Created: 2018/11/14 21:15:09 by hulamy            #+#    #+#             */
+/*   Updated: 2018/11/14 21:15:10 by hulamy           ###   ########.fr       */
+/*                                                                            */
+/* ************************************************************************** */
+
+#include "libft.h"
+
+void	ft_putnbr_fd(int n, int fd)
+{
+	long	l;
+
+	l = n;
+	if (l < 0)
+	{
+		ft_putchar_fd('-', fd);
+		l *= -1;
+	}
+	if (l >= 10)
+		ft_putnbr_fd(l / 10, fd);
+	ft_putchar_fd((l % 10) + '0', fd);
+}
--- a/libft/src/put/ft_putnbrbase.c
+++ b/libft/src/put/ft_putnbrbase.c
@@ -0,0 +1,59 @@
+/* ************************************************************************** */
+/*                                                                            */
+/*                                                        :::      ::::::::   */
+/*   ft_putnbrbase.c                                    :+:      :+:    :+:   */
+/*                                                    +:+ +:+         +:+     */
+/*   By: hulamy <marvin@42.fr>                      +#+  +:+       +#+        */
+/*                                                +#+#+#+#+#+   +#+           */
+/*   Created: 2018/11/16 15:17:00 by hulamy            #+#    #+#             */
+/*   Updated: 2018/11/16 15:23:43 by hulamy           ###   ########.fr       */
+/*                                                                            */
+/* ************************************************************************** */
+
+#include "libft.h"
+
+static int	check(char *base)
+{
+	int i;
+	int j;
+
+	i = 0;
+	while (base[i])
+	{
+		j = i + 1;
+		while (base[j])
+		{
+			if (base[i] == base[j])
+				return (0);
+			j++;
+		}
+		if (base[i] == '-' || base[i] == '+')
+			return (0);
+		i++;
+	}
+	if (i >= 2)
+		return (1);
+	return (0);
+}
+
+void		ft_putnbrbase(int nbr, char *base)
+{
+	int		i;
+	long	n;
+
+	i = 0;
+	n = nbr;
+	if (check(base))
+	{
+		if (n < 0)
+		{
+			ft_putchar('-');
+			n = -n;
+		}
+		while (base[i])
+			i++;
+		if (n >= i)
+			ft_putnbrbase(n / i, base);
+		ft_putchar(base[n % i]);
+	}
+}
--- a/libft/src/put/ft_putnbrendl.c
+++ b/libft/src/put/ft_putnbrendl.c
@@ -0,0 +1,18 @@
+/* ************************************************************************** */
+/*                                                                            */
+/*                                                        :::      ::::::::   */
+/*   ft_putnbrendl.c                                    :+:      :+:    :+:   */
+/*                                                    +:+ +:+         +:+     */
+/*   By: hulamy <marvin@42.fr>                      +#+  +:+       +#+        */
+/*                                                +#+#+#+#+#+   +#+           */
+/*   Created: 2019/02/19 10:38:07 by hulamy            #+#    #+#             */
+/*   Updated: 2019/02/19 10:42:46 by hulamy           ###   ########.fr       */
+/*                                                                            */
+/* ************************************************************************** */
+
+#include "libft.h"
+
+void	ft_putnbrendl(int n)
+{
+	ft_putnbrendl_fd(n, 1);
+}
--- a/libft/src/put/ft_putnbrendl_fd.c
+++ b/libft/src/put/ft_putnbrendl_fd.c
@@ -0,0 +1,29 @@
+/* ************************************************************************** */
+/*                                                                            */
+/*                                                        :::      ::::::::   */
+/*   ft_putnbrendl_fd.c                                 :+:      :+:    :+:   */
+/*                                                    +:+ +:+         +:+     */
+/*   By: hulamy <marvin@42.fr>                      +#+  +:+       +#+        */
+/*                                                +#+#+#+#+#+   +#+           */
+/*   Created: 2019/02/19 10:37:58 by hulamy            #+#    #+#             */
+/*   Updated: 2019/02/19 10:42:48 by hulamy           ###   ########.fr       */
+/*                                                                            */
+/* ************************************************************************** */
+
+#include "libft.h"
+
+void	ft_putnbrendl_fd(int n, int fd)
+{
+	long	l;
+
+	l = n;
+	if (l < 0)
+	{
+		ft_putchar_fd('-', fd);
+		l *= -1;
+	}
+	if (l >= 10)
+		ft_putnbr_fd(l / 10, fd);
+	ft_putchar_fd((l % 10) + '0', fd);
+	ft_putchar_fd('\n', fd);
+}
--- a/libft/src/put/ft_putstr.c
+++ b/libft/src/put/ft_putstr.c
@@ -0,0 +1,22 @@
+/* ************************************************************************** */
+/*                                                                            */
+/*                                                        :::      ::::::::   */
+/*   ft_putstr.c                                        :+:      :+:    :+:   */
+/*                                                    +:+ +:+         +:+     */
+/*   By: hulamy <marvin@42.fr>                      +#+  +:+       +#+        */
+/*                                                +#+#+#+#+#+   +#+           */
+/*   Created: 2018/11/14 21:15:19 by hulamy            #+#    #+#             */
+/*   Updated: 2018/11/14 21:15:19 by hulamy           ###   ########.fr       */
+/*                                                                            */
+/* ************************************************************************** */
+
+#include "libft.h"
+
+void	ft_putstr(char const *s)
+{
+	int i;
+
+	i = 0;
+	while (s && s[i])
+		ft_putchar(s[i++]);
+}
--- a/libft/src/put/ft_putstr_fd.c
+++ b/libft/src/put/ft_putstr_fd.c
@@ -0,0 +1,19 @@
+/* ************************************************************************** */
+/*                                                                            */
+/*                                                        :::      ::::::::   */
+/*   ft_putstr_fd.c                                     :+:      :+:    :+:   */
+/*                                                    +:+ +:+         +:+     */
+/*   By: hulamy <marvin@42.fr>                      +#+  +:+       +#+        */
+/*                                                +#+#+#+#+#+   +#+           */
+/*   Created: 2018/11/14 21:15:31 by hulamy            #+#    #+#             */
+/*   Updated: 2018/11/14 21:15:32 by hulamy           ###   ########.fr       */
+/*                                                                            */
+/* ************************************************************************** */
+
+#include "libft.h"
+
+void	ft_putstr_fd(char const *s, int fd)
+{
+	while (s && *s)
+		ft_putchar_fd(*s++, fd);
+}
--- a/libft/src/str/ft_strcat.c
+++ b/libft/src/str/ft_strcat.c
@@ -0,0 +1,32 @@
+/* ************************************************************************** */
+/*                                                                            */
+/*                                                        :::      ::::::::   */
+/*   ft_strcat.c                                        :+:      :+:    :+:   */
+/*                                                    +:+ +:+         +:+     */
+/*   By: hulamy <marvin@42.fr>                      +#+  +:+       +#+        */
+/*                                                +#+#+#+#+#+   +#+           */
+/*   Created: 2018/11/14 21:15:40 by hulamy            #+#    #+#             */
+/*   Updated: 2019/03/25 15:12:58 by hulamy           ###   ########.fr       */
+/*                                                                            */
+/* ************************************************************************** */
+
+/*
+** append src to dest (dest must have sufficient space) and return dest
+*/
+
+#include "libft.h"
+
+char	*ft_strcat(char *dest, const char *src)
+{
+	int i;
+	int j;
+
+	i = 0;
+	j = 0;
+	while (dest[i])
+		i++;
+	while (src[j])
+		dest[i++] = src[j++];
+	dest[i] = '\0';
+	return (dest);
+}
--- a/libft/src/str/ft_strchr.c
+++ b/libft/src/str/ft_strchr.c
@@ -0,0 +1,33 @@
+/* ************************************************************************** */
+/*                                                                            */
+/*                                                        :::      ::::::::   */
+/*   ft_strchr.c                                        :+:      :+:    :+:   */
+/*                                                    +:+ +:+         +:+     */
+/*   By: hulamy <marvin@42.fr>                      +#+  +:+       +#+        */
+/*                                                +#+#+#+#+#+   +#+           */
+/*   Created: 2018/11/14 21:15:48 by hulamy            #+#    #+#             */
+/*   Updated: 2019/04/16 17:28:46 by hulamy           ###   ########.fr       */
+/*                                                                            */
+/* ************************************************************************** */
+
+/*
+** locate the first occurence of character c in string s
+** and return pointer to its location
+*/
+
+#include "libft.h"
+
+char	*ft_strchr(const char *s, int c)
+{
+	int	i;
+	int	j;
+
+	i = 0;
+	j = -1;
+	while (s[i])
+		i++;
+	while (++j < i + 1)
+		if (s[j] == c)
+			return ((char *)s + j);
+	return (NULL);
+}
--- a/libft/src/str/ft_strclr.c
+++ b/libft/src/str/ft_strclr.c
@@ -0,0 +1,23 @@
+/* ************************************************************************** */
+/*                                                                            */
+/*                                                        :::      ::::::::   */
+/*   ft_strclr.c                                        :+:      :+:    :+:   */
+/*                                                    +:+ +:+         +:+     */
+/*   By: hulamy <marvin@42.fr>                      +#+  +:+       +#+        */
+/*                                                +#+#+#+#+#+   +#+           */
+/*   Created: 2018/11/14 21:15:58 by hulamy            #+#    #+#             */
+/*   Updated: 2019/03/25 15:17:42 by hulamy           ###   ########.fr       */
+/*                                                                            */
+/* ************************************************************************** */
+
+/*
+** fill string with zeros
+*/
+
+#include "libft.h"
+
+void	ft_strclr(char *s)
+{
+	if (s)
+		ft_bzero(s, ft_strlen(s));
+}
--- a/libft/src/str/ft_strcmp.c
+++ b/libft/src/str/ft_strcmp.c
@@ -0,0 +1,28 @@
+/* ************************************************************************** */
+/*                                                                            */
+/*                                                        :::      ::::::::   */
+/*   ft_strcmp.c                                        :+:      :+:    :+:   */
+/*                                                    +:+ +:+         +:+     */
+/*   By: hulamy <marvin@42.fr>                      +#+  +:+       +#+        */
+/*                                                +#+#+#+#+#+   +#+           */
+/*   Created: 2018/11/14 21:16:08 by hulamy            #+#    #+#             */
+/*   Updated: 2019/03/25 15:18:30 by hulamy           ###   ########.fr       */
+/*                                                                            */
+/* ************************************************************************** */
+
+/*
+** compare two null terminated strings and return value
+** of difference between first two different character
+*/
+
+#include "libft.h"
+
+int		ft_strcmp(const char *s1, const char *s2)
+{
+	int	i;
+
+	i = 0;
+	while (s1[i] && s1[i] == s2[i])
+		i++;
+	return ((unsigned char)s1[i] - (unsigned char)s2[i]);
+}
--- a/libft/src/str/ft_strcpy.c
+++ b/libft/src/str/ft_strcpy.c
@@ -0,0 +1,28 @@
+/* ************************************************************************** */
+/*                                                                            */
+/*                                                        :::      ::::::::   */
+/*   ft_strcpy.c                                        :+:      :+:    :+:   */
+/*                                                    +:+ +:+         +:+     */
+/*   By: hulamy <marvin@42.fr>                      +#+  +:+       +#+        */
+/*                                                +#+#+#+#+#+   +#+           */
+/*   Created: 2018/11/14 21:16:17 by hulamy            #+#    #+#             */
+/*   Updated: 2019/03/25 15:19:19 by hulamy           ###   ########.fr       */
+/*                                                                            */
+/* ************************************************************************** */
+
+/*
+** copy string src to dst including '\0' and return dst
+*/
+
+#include "libft.h"
+
+char	*ft_strcpy(char *dest, const char *src)
+{
+	int i;
+
+	i = -1;
+	while (src[++i])
+		dest[i] = src[i];
+	dest[i] = '\0';
+	return (dest);
+}
--- a/libft/src/str/ft_strdel.c
+++ b/libft/src/str/ft_strdel.c
@@ -0,0 +1,26 @@
+/* ************************************************************************** */
+/*                                                                            */
+/*                                                        :::      ::::::::   */
+/*   ft_strdel.c                                        :+:      :+:    :+:   */
+/*                                                    +:+ +:+         +:+     */
+/*   By: hulamy <marvin@42.fr>                      +#+  +:+       +#+        */
+/*                                                +#+#+#+#+#+   +#+           */
+/*   Created: 2018/11/14 21:16:25 by hulamy            #+#    #+#             */
+/*   Updated: 2019/03/25 15:19:54 by hulamy           ###   ########.fr       */
+/*                                                                            */
+/* ************************************************************************** */
+
+/*
+** free memory
+*/
+
+#include "libft.h"
+
+void	ft_strdel(char **as)
+{
+	if (as && *as)
+	{
+		free(*as);
+		*as = 0;
+	}
+}
--- a/libft/src/str/ft_strdup.c
+++ b/libft/src/str/ft_strdup.c
@@ -0,0 +1,32 @@
+/* ************************************************************************** */
+/*                                                                            */
+/*                                                        :::      ::::::::   */
+/*   ft_strdup.c                                        :+:      :+:    :+:   */
+/*                                                    +:+ +:+         +:+     */
+/*   By: hulamy <marvin@42.fr>                      +#+  +:+       +#+        */
+/*                                                +#+#+#+#+#+   +#+           */
+/*   Created: 2018/11/14 21:16:32 by hulamy            #+#    #+#             */
+/*   Updated: 2019/03/25 15:20:22 by hulamy           ###   ########.fr       */
+/*                                                                            */
+/* ************************************************************************** */
+
+/*
+** save a copy of string src by allocating memory and return pointer to copy
+*/
+
+#include "libft.h"
+
+char	*ft_strdup(const char *src)
+{
+	int		i;
+	char	*str;
+
+	i = 0;
+	while (src[i] != '\0')
+		i++;
+	if (!(str = (char*)malloc(sizeof(*str) * (i + 1))))
+		return (NULL);
+	while (i-- >= 0)
+		str[i + 1] = src[i + 1];
+	return (str);
+}
--- a/libft/src/str/ft_strequ.c
+++ b/libft/src/str/ft_strequ.c
@@ -0,0 +1,24 @@
+/* ************************************************************************** */
+/*                                                                            */
+/*                                                        :::      ::::::::   */
+/*   ft_strequ.c                                        :+:      :+:    :+:   */
+/*                                                    +:+ +:+         +:+     */
+/*   By: hulamy <marvin@42.fr>                      +#+  +:+       +#+        */
+/*                                                +#+#+#+#+#+   +#+           */
+/*   Created: 2018/11/14 21:16:44 by hulamy            #+#    #+#             */
+/*   Updated: 2019/03/25 15:21:02 by hulamy           ###   ########.fr       */
+/*                                                                            */
+/* ************************************************************************** */
+
+/*
+** return 0 if strings s1 and s2 are identical and 1 if not
+*/
+
+#include "libft.h"
+
+int		ft_strequ(char const *s1, char const *s2)
+{
+	if (!s1 || !s2)
+		return (0);
+	return (ft_strcmp(s1, s2) == 0);
+}
--- a/libft/src/str/ft_striter.c
+++ b/libft/src/str/ft_striter.c
@@ -0,0 +1,23 @@
+/* ************************************************************************** */
+/*                                                                            */
+/*                                                        :::      ::::::::   */
+/*   ft_striter.c                                       :+:      :+:    :+:   */
+/*                                                    +:+ +:+         +:+     */
+/*   By: hulamy <marvin@42.fr>                      +#+  +:+       +#+        */
+/*                                                +#+#+#+#+#+   +#+           */
+/*   Created: 2018/11/14 21:16:53 by hulamy            #+#    #+#             */
+/*   Updated: 2019/03/25 15:21:14 by hulamy           ###   ########.fr       */
+/*                                                                            */
+/* ************************************************************************** */
+
+/*
+** apply function f to each element of string s
+*/
+
+#include "libft.h"
+
+void	ft_striter(char *s, void (*f)(char *))
+{
+	while (s && *s && f)
+		f(s++);
+}
--- a/libft/src/str/ft_striteri.c
+++ b/libft/src/str/ft_striteri.c
@@ -0,0 +1,26 @@
+/* ************************************************************************** */
+/*                                                                            */
+/*                                                        :::      ::::::::   */
+/*   ft_striteri.c                                      :+:      :+:    :+:   */
+/*                                                    +:+ +:+         +:+     */
+/*   By: hulamy <marvin@42.fr>                      +#+  +:+       +#+        */
+/*                                                +#+#+#+#+#+   +#+           */
+/*   Created: 2018/11/14 21:17:04 by hulamy            #+#    #+#             */
+/*   Updated: 2019/03/25 15:21:27 by hulamy           ###   ########.fr       */
+/*                                                                            */
+/* ************************************************************************** */
+
+/*
+** apply function f to each element of string s with index specified
+*/
+
+#include "libft.h"
+
+void	ft_striteri(char *s, void (*f)(unsigned int, char *))
+{
+	int		i;
+
+	i = 0;
+	while (s && *s && f)
+		f(i++, s++);
+}
--- a/libft/src/str/ft_strjoin.c
+++ b/libft/src/str/ft_strjoin.c
@@ -0,0 +1,54 @@
+/* ************************************************************************** */
+/*                                                                            */
+/*                                                        :::      ::::::::   */
+/*   ft_strjoin.c                                       :+:      :+:    :+:   */
+/*                                                    +:+ +:+         +:+     */
+/*   By: hulamy <marvin@42.fr>                      +#+  +:+       +#+        */
+/*                                                +#+#+#+#+#+   +#+           */
+/*   Created: 2018/11/14 21:17:12 by hulamy            #+#    #+#             */
+/*   Updated: 2019/03/25 15:31:03 by hulamy           ###   ########.fr       */
+/*                                                                            */
+/* ************************************************************************** */
+
+/*
+** create a new string by concatenating the two strings s1 and s2
+*/
+
+#include "libft.h"
+
+static char	*ft_doit(char const *s1, char const *s2, char *dest)
+{
+	int	j;
+	int	i;
+
+	j = 0;
+	i = 0;
+	while (s1[j] != '\0')
+	{
+		dest[i] = s1[j];
+		i++;
+		j++;
+	}
+	j = 0;
+	while (s2[j] != '\0')
+	{
+		dest[i] = s2[j];
+		i++;
+		j++;
+	}
+	dest[i] = '\0';
+	return (dest);
+}
+
+char		*ft_strjoin(char const *s1, char const *s2)
+{
+	char	*str;
+
+	if (!s1 || !s2)
+		return (NULL);
+	if (!(str = (char *)malloc(sizeof(char) *
+					(ft_strlen(s1) + ft_strlen(s2) + 1))))
+		return (NULL);
+	str = ft_doit(s1, s2, str);
+	return (str);
+}
--- a/libft/src/str/ft_strjoinfree.c
+++ b/libft/src/str/ft_strjoinfree.c
@@ -0,0 +1,28 @@
+/* ************************************************************************** */
+/*                                                                            */
+/*                                                        :::      ::::::::   */
+/*   ft_strjoinfree.c                                   :+:      :+:    :+:   */
+/*                                                    +:+ +:+         +:+     */
+/*   By: hulamy <marvin@42.fr>                      +#+  +:+       +#+        */
+/*                                                +#+#+#+#+#+   +#+           */
+/*   Created: 2019/03/05 15:05:28 by hulamy            #+#    #+#             */
+/*   Updated: 2019/03/25 15:22:28 by hulamy           ###   ########.fr       */
+/*                                                                            */
+/* ************************************************************************** */
+
+/*
+** create a new string by concatenating the two strings s1
+** and s2 then freeing them
+*/
+
+#include "libft.h"
+
+char	*ft_strjoinfree(char *s1, char *s2)
+{
+	char	*str;
+
+	if (!(str = ft_strjoin(s1, s2)))
+		return (NULL);
+	free(s1);
+	return (str);
+}
--- a/libft/src/str/ft_strlcat.c
+++ b/libft/src/str/ft_strlcat.c
@@ -0,0 +1,38 @@
+/* ************************************************************************** */
+/*                                                                            */
+/*                                                        :::      ::::::::   */
+/*   ft_strlcat.c                                       :+:      :+:    :+:   */
+/*                                                    +:+ +:+         +:+     */
+/*   By: hulamy <marvin@42.fr>                      +#+  +:+       +#+        */
+/*                                                +#+#+#+#+#+   +#+           */
+/*   Created: 2018/11/14 21:17:22 by hulamy            #+#    #+#             */
+/*   Updated: 2019/03/25 15:22:42 by hulamy           ###   ########.fr       */
+/*                                                                            */
+/* ************************************************************************** */
+
+/*
+** append src to sized dest and return size of final dest
+*/
+
+#include "libft.h"
+
+size_t		ft_strlcat(char *dest, const char *src, size_t size)
+{
+	size_t i;
+	size_t j;
+
+	i = 0;
+	j = 0;
+	while (dest[i] && i < size)
+		i++;
+	while (src[j])
+	{
+		if (j + i < size - 1 && size)
+		{
+			dest[i + j] = src[j];
+			dest[i + j + 1] = '\0';
+		}
+		j++;
+	}
+	return (i + j);
+}
--- a/libft/src/str/ft_strlen.c
+++ b/libft/src/str/ft_strlen.c
@@ -0,0 +1,27 @@
+/* ************************************************************************** */
+/*                                                                            */
+/*                                                        :::      ::::::::   */
+/*   ft_strlen.c                                        :+:      :+:    :+:   */
+/*                                                    +:+ +:+         +:+     */
+/*   By: hulamy <marvin@42.fr>                      +#+  +:+       +#+        */
+/*                                                +#+#+#+#+#+   +#+           */
+/*   Created: 2018/11/14 21:17:32 by hulamy            #+#    #+#             */
+/*   Updated: 2019/03/25 15:23:00 by hulamy           ###   ########.fr       */
+/*                                                                            */
+/* ************************************************************************** */
+
+/*
+** return length of of string
+*/
+
+#include "libft.h"
+
+size_t		ft_strlen(const char *str)
+{
+	size_t i;
+
+	i = 0;
+	while (str[i])
+		i++;
+	return (i);
+}
--- a/libft/src/str/ft_strmap.c
+++ b/libft/src/str/ft_strmap.c
@@ -0,0 +1,32 @@
+/* ************************************************************************** */
+/*                                                                            */
+/*                                                        :::      ::::::::   */
+/*   ft_strmap.c                                        :+:      :+:    :+:   */
+/*                                                    +:+ +:+         +:+     */
+/*   By: hulamy <marvin@42.fr>                      +#+  +:+       +#+        */
+/*                                                +#+#+#+#+#+   +#+           */
+/*   Created: 2018/11/14 21:17:49 by hulamy            #+#    #+#             */
+/*   Updated: 2019/03/25 15:23:12 by hulamy           ###   ########.fr       */
+/*                                                                            */
+/* ************************************************************************** */
+
+/*
+** create a new array with the result of function f on every element of s
+*/
+
+#include "libft.h"
+
+char	*ft_strmap(char const *s, char (*f)(char))
+{
+	char	*str;
+	int		i;
+
+	if (!s)
+		return (NULL);
+	if (!(str = ft_strnew(ft_strlen(s))))
+		return (NULL);
+	i = -1;
+	while (s[++i])
+		str[i] = f(s[i]);
+	return (str);
+}
--- a/libft/src/str/ft_strmapi.c
+++ b/libft/src/str/ft_strmapi.c
@@ -0,0 +1,33 @@
+/* ************************************************************************** */
+/*                                                                            */
+/*                                                        :::      ::::::::   */
+/*   ft_strmapi.c                                       :+:      :+:    :+:   */
+/*                                                    +:+ +:+         +:+     */
+/*   By: hulamy <marvin@42.fr>                      +#+  +:+       +#+        */
+/*                                                +#+#+#+#+#+   +#+           */
+/*   Created: 2018/11/14 21:18:03 by hulamy            #+#    #+#             */
+/*   Updated: 2019/03/25 15:28:21 by hulamy           ###   ########.fr       */
+/*                                                                            */
+/* ************************************************************************** */
+
+/*
+** create a new array with the result of function f
+** on every element of s by index i
+*/
+
+#include "libft.h"
+
+char	*ft_strmapi(char const *s, char (*f)(unsigned int, char))
+{
+	char	*str;
+	int		i;
+
+	if (!s)
+		return (NULL);
+	if (!(str = ft_strnew(ft_strlen(s))))
+		return (NULL);
+	i = -1;
+	while (s[++i])
+		str[i] = f(i, s[i]);
+	return (str);
+}
--- a/libft/src/str/ft_strmultisplit.c
+++ b/libft/src/str/ft_strmultisplit.c
@@ -0,0 +1,83 @@
+/* ************************************************************************** */
+/*                                                                            */
+/*                                                        :::      ::::::::   */
+/*   ft_strmultisplit.c                                 :+:      :+:    :+:   */
+/*                                                    +:+ +:+         +:+     */
+/*   By: hulamy <marvin@42.fr>                      +#+  +:+       +#+        */
+/*                                                +#+#+#+#+#+   +#+           */
+/*   Created: 2018/11/16 15:18:29 by hulamy            #+#    #+#             */
+/*   Updated: 2019/03/25 15:23:57 by hulamy           ###   ########.fr       */
+/*                                                                            */
+/* ************************************************************************** */
+
+/*
+** return an array of string with each word found in str
+** with any character of charset difining a separator
+*/
+
+#include "libft.h"
+
+static int	ft_is_separator(char c, char *charset, int i)
+{
+	while (charset[i])
+	{
+		if (c == charset[i])
+			return (1);
+		i++;
+	}
+	c = charset[i];
+	return (0);
+}
+
+static int	ft_count(char *str, int word, char **tab, char *charset)
+{
+	int		i;
+	int		j;
+	int		k;
+
+	k = 0;
+	i = 0;
+	while (ft_is_separator(str[k], charset, 0) == 1)
+		k++;
+	while (str[k] != '\0' && i != word)
+	{
+		j = 0;
+		while (!ft_is_separator(str[k + j], charset, 0) && str[k + j] != '\0')
+		{
+			if (word == -2)
+				tab[i][j] = str[k + j];
+			j++;
+		}
+		k += j;
+		while (ft_is_separator(str[k], charset, 0))
+			k++;
+		i++;
+	}
+	if (word == -1)
+		return (i);
+	return (j);
+}
+
+char		**ft_strmultisplit(char *str, char *charset)
+{
+	char	**tab;
+	int		i;
+	int		j;
+	int		k;
+
+	k = 0;
+	tab = 0;
+	i = ft_count(str, -1, tab, charset);
+	if (!(tab = (char**)malloc(sizeof(tab) * (i + 1))))
+		return (NULL);
+	tab[i] = 0;
+	while (k < i)
+	{
+		j = ft_count(str, k + 1, tab, charset);
+		tab[k] = (char*)malloc(sizeof(*tab) * (j + 1));
+		tab[k][j] = '\0';
+		k++;
+	}
+	ft_count(str, -2, tab, charset);
+	return (tab);
+}
--- a/libft/src/str/ft_strncat.c
+++ b/libft/src/str/ft_strncat.c
@@ -0,0 +1,32 @@
+/* ************************************************************************** */
+/*                                                                            */
+/*                                                        :::      ::::::::   */
+/*   ft_strncat.c                                       :+:      :+:    :+:   */
+/*                                                    +:+ +:+         +:+     */
+/*   By: hulamy <marvin@42.fr>                      +#+  +:+       +#+        */
+/*                                                +#+#+#+#+#+   +#+           */
+/*   Created: 2018/11/14 21:18:24 by hulamy            #+#    #+#             */
+/*   Updated: 2019/03/25 15:24:11 by hulamy           ###   ########.fr       */
+/*                                                                            */
+/* ************************************************************************** */
+
+/*
+** append n character of src to dest and return dest
+*/
+
+#include "libft.h"
+
+char	*ft_strncat(char *dest, const char *src, size_t nb)
+{
+	size_t	i;
+	size_t	j;
+
+	i = 0;
+	j = 0;
+	while (dest[i])
+		i++;
+	while (src[j] && j < nb)
+		dest[i++] = src[j++];
+	dest[i] = '\0';
+	return (dest);
+}
--- a/libft/src/str/ft_strncmp.c
+++ b/libft/src/str/ft_strncmp.c
@@ -0,0 +1,32 @@
+/* ************************************************************************** */
+/*                                                                            */
+/*                                                        :::      ::::::::   */
+/*   ft_strncmp.c                                       :+:      :+:    :+:   */
+/*                                                    +:+ +:+         +:+     */
+/*   By: hulamy <marvin@42.fr>                      +#+  +:+       +#+        */
+/*                                                +#+#+#+#+#+   +#+           */
+/*   Created: 2018/11/14 21:18:34 by hulamy            #+#    #+#             */
+/*   Updated: 2019/03/25 15:24:35 by hulamy           ###   ########.fr       */
+/*                                                                            */
+/* ************************************************************************** */
+
+/*
+** compare size first character of two null terminated strings
+** and return value of difference between first two different character
+*/
+
+#include "libft.h"
+
+int		ft_strncmp(const char *s1, const char *s2, size_t n)
+{
+	size_t	i;
+	int		res;
+
+	i = 0;
+	res = 0;
+	while (s1[i] && s1[i] == s2[i] && i < n - 1)
+		i++;
+	if (n != 0)
+		res = (unsigned char)s1[i] - (unsigned char)s2[i];
+	return (res);
+}
--- a/libft/src/str/ft_strncpy.c
+++ b/libft/src/str/ft_strncpy.c
@@ -0,0 +1,30 @@
+/* ************************************************************************** */
+/*                                                                            */
+/*                                                        :::      ::::::::   */
+/*   ft_strncpy.c                                       :+:      :+:    :+:   */
+/*                                                    +:+ +:+         +:+     */
+/*   By: hulamy <marvin@42.fr>                      +#+  +:+       +#+        */
+/*                                                +#+#+#+#+#+   +#+           */
+/*   Created: 2018/11/14 21:18:44 by hulamy            #+#    #+#             */
+/*   Updated: 2019/03/25 15:24:59 by hulamy           ###   ########.fr       */
+/*                                                                            */
+/* ************************************************************************** */
+
+/*
+** copy n characters from string src to dst including '\0'
+** if space remain it's filled zith '\0', and return dst
+*/
+
+#include "libft.h"
+
+char	*ft_strncpy(char *dest, const char *src, size_t n)
+{
+	size_t i;
+
+	i = -1;
+	while (++i < n && src[i])
+		dest[i] = src[i];
+	while (i < n)
+		dest[i++] = '\0';
+	return (dest);
+}
--- a/libft/src/str/ft_strnequ.c
+++ b/libft/src/str/ft_strnequ.c
@@ -0,0 +1,25 @@
+/* ************************************************************************** */
+/*                                                                            */
+/*                                                        :::      ::::::::   */
+/*   ft_strnequ.c                                       :+:      :+:    :+:   */
+/*                                                    +:+ +:+         +:+     */
+/*   By: hulamy <marvin@42.fr>                      +#+  +:+       +#+        */
+/*                                                +#+#+#+#+#+   +#+           */
+/*   Created: 2018/11/14 21:18:55 by hulamy            #+#    #+#             */
+/*   Updated: 2019/03/25 15:25:20 by hulamy           ###   ########.fr       */
+/*                                                                            */
+/* ************************************************************************** */
+
+/*
+** return 0 if n first character of strings s1 and s2 are identical
+** and 1 if not
+*/
+
+#include "libft.h"
+
+int		ft_strnequ(char const *s1, char const *s2, size_t n)
+{
+	if (!s1 || !s2)
+		return (0);
+	return (ft_strncmp(s1, s2, n) == 0);
+}
--- a/libft/src/str/ft_strnew.c
+++ b/libft/src/str/ft_strnew.c
@@ -0,0 +1,27 @@
+/* ************************************************************************** */
+/*                                                                            */
+/*                                                        :::      ::::::::   */
+/*   ft_strnew.c                                        :+:      :+:    :+:   */
+/*                                                    +:+ +:+         +:+     */
+/*   By: hulamy <marvin@42.fr>                      +#+  +:+       +#+        */
+/*                                                +#+#+#+#+#+   +#+           */
+/*   Created: 2018/11/14 21:19:08 by hulamy            #+#    #+#             */
+/*   Updated: 2019/03/25 15:25:38 by hulamy           ###   ########.fr       */
+/*                                                                            */
+/* ************************************************************************** */
+
+/*
+** create a new string of length size, fill with zero, and return pointer to it
+*/
+
+#include "libft.h"
+
+char	*ft_strnew(size_t size)
+{
+	char	*str;
+
+	if (!(str = (char *)malloc(sizeof(char) * (size + 1))))
+		return (NULL);
+	ft_bzero(str, size + 1);
+	return (str);
+}
--- a/libft/src/str/ft_strnstr.c
+++ b/libft/src/str/ft_strnstr.c
@@ -0,0 +1,42 @@
+/* ************************************************************************** */
+/*                                                                            */
+/*                                                        :::      ::::::::   */
+/*   ft_strnstr.c                                       :+:      :+:    :+:   */
+/*                                                    +:+ +:+         +:+     */
+/*   By: hulamy <marvin@42.fr>                      +#+  +:+       +#+        */
+/*                                                +#+#+#+#+#+   +#+           */
+/*   Created: 2018/11/14 21:19:16 by hulamy            #+#    #+#             */
+/*   Updated: 2019/03/25 15:25:57 by hulamy           ###   ########.fr       */
+/*                                                                            */
+/* ************************************************************************** */
+
+/*
+** locate the first occurence of the string little in len first characters
+** of big and return a pointer to this occurence if found
+*/
+
+#include "libft.h"
+
+char	*ft_strnstr(const char *big, const char *little, size_t len)
+{
+	size_t i;
+	size_t j;
+
+	j = 0;
+	i = 0;
+	if (!ft_strlen(little))
+		return ((char *)big);
+	while (i == 0 && j <= len)
+	{
+		while (little[i] == big[j + i] && little[i] && j + i <= len)
+			i++;
+		if (little[i])
+		{
+			j++;
+			if (!big[j] || j >= len)
+				return (0);
+			i = 0;
+		}
+	}
+	return ((char *)big + j);
+}
--- a/libft/src/str/ft_strrchr.c
+++ b/libft/src/str/ft_strrchr.c
@@ -0,0 +1,32 @@
+/* ************************************************************************** */
+/*                                                                            */
+/*                                                        :::      ::::::::   */
+/*   ft_strrchr.c                                       :+:      :+:    :+:   */
+/*                                                    +:+ +:+         +:+     */
+/*   By: hulamy <marvin@42.fr>                      +#+  +:+       +#+        */
+/*                                                +#+#+#+#+#+   +#+           */
+/*   Created: 2018/11/14 21:19:23 by hulamy            #+#    #+#             */
+/*   Updated: 2019/03/25 15:26:21 by hulamy           ###   ########.fr       */
+/*                                                                            */
+/* ************************************************************************** */
+
+/*
+** locate the last occurence of character c in string s
+** and return pointer to its location
+*/
+
+#include "libft.h"
+
+char	*ft_strrchr(const char *s, int c)
+{
+	int	i;
+
+	i = 0;
+	while (s[i])
+		i++;
+	i++;
+	while (i--)
+		if (s[i] == c)
+			return ((char *)s + i);
+	return (NULL);
+}
--- a/libft/src/str/ft_strsplit.c
+++ b/libft/src/str/ft_strsplit.c
@@ -0,0 +1,62 @@
+/* ************************************************************************** */
+/*                                                                            */
+/*                                                        :::      ::::::::   */
+/*   ft_strsplit.c                                      :+:      :+:    :+:   */
+/*                                                    +:+ +:+         +:+     */
+/*   By: hulamy <marvin@42.fr>                      +#+  +:+       +#+        */
+/*                                                +#+#+#+#+#+   +#+           */
+/*   Created: 2018/11/14 21:19:36 by hulamy            #+#    #+#             */
+/*   Updated: 2019/03/25 15:26:39 by hulamy           ###   ########.fr       */
+/*                                                                            */
+/* ************************************************************************** */
+
+/*
+** return an array of string with each word found in str, with c as separator
+*/
+
+#include "libft.h"
+
+static int	ft_count_word(char const *s, char c)
+{
+	int		i;
+	int		len;
+
+	i = -1;
+	len = 0;
+	while (s[++i])
+		if (s[i] != c)
+		{
+			len++;
+			while (s[i] && s[i] != c)
+				i++;
+		}
+	return (len);
+}
+
+char		**ft_strsplit(char const *s, char c)
+{
+	char	**array;
+	int		i;
+	int		j;
+	int		len;
+
+	i = -1;
+	j = 0;
+	if (!s || !c)
+		return (0);
+	if (!(array = (char **)malloc(sizeof(char *) * (ft_count_word(s, c) + 1))))
+		return (NULL);
+	while (s[++i])
+	{
+		if (s[i] != c)
+		{
+			len = 0;
+			while (s[i + len] && s[i + len] != c)
+				len++;
+			array[j++] = ft_strsub(s, i, len);
+			i = i + len - 1;
+		}
+	}
+	array[j] = 0;
+	return (array);
+}
--- a/libft/src/str/ft_strstr.c
+++ b/libft/src/str/ft_strstr.c
@@ -0,0 +1,42 @@
+/* ************************************************************************** */
+/*                                                                            */
+/*                                                        :::      ::::::::   */
+/*   ft_strstr.c                                        :+:      :+:    :+:   */
+/*                                                    +:+ +:+         +:+     */
+/*   By: hulamy <marvin@42.fr>                      +#+  +:+       +#+        */
+/*                                                +#+#+#+#+#+   +#+           */
+/*   Created: 2018/11/14 21:19:45 by hulamy            #+#    #+#             */
+/*   Updated: 2019/03/25 15:26:59 by hulamy           ###   ########.fr       */
+/*                                                                            */
+/* ************************************************************************** */
+
+/*
+** locate the first occurence of the string little in big
+** and return a pointer to this occurence if found
+*/
+
+#include "libft.h"
+
+char	*ft_strstr(const char *str, const char *to_find)
+{
+	int i;
+	int j;
+
+	j = 0;
+	i = 0;
+	if (!ft_strlen(to_find))
+		return ((char *)str);
+	while (i == 0)
+	{
+		while (to_find[i] && to_find[i] == str[j + i])
+			i++;
+		if (to_find[i])
+		{
+			j++;
+			if (str[j] == '\0' && to_find[i])
+				return (0);
+			i = 0;
+		}
+	}
+	return ((char *)str + j);
+}
--- a/libft/src/str/ft_strsub.c
+++ b/libft/src/str/ft_strsub.c
@@ -0,0 +1,32 @@
+/* ************************************************************************** */
+/*                                                                            */
+/*                                                        :::      ::::::::   */
+/*   ft_strsub.c                                        :+:      :+:    :+:   */
+/*                                                    +:+ +:+         +:+     */
+/*   By: hulamy <marvin@42.fr>                      +#+  +:+       +#+        */
+/*                                                +#+#+#+#+#+   +#+           */
+/*   Created: 2018/11/14 21:19:52 by hulamy            #+#    #+#             */
+/*   Updated: 2019/03/25 15:27:14 by hulamy           ###   ########.fr       */
+/*                                                                            */
+/* ************************************************************************** */
+
+/*
+** create a copy of a portion of s, begining at start and of length len
+*/
+
+#include "libft.h"
+
+char	*ft_strsub(char const *s, unsigned int start, size_t len)
+{
+	char	*str;
+	size_t	i;
+
+	if (!s)
+		return (NULL);
+	if (!(str = ft_strnew(len)))
+		return (NULL);
+	i = 0;
+	while (i < len)
+		str[i++] = s[start++];
+	return (str);
+}
--- a/libft/src/str/ft_strtrim.c
+++ b/libft/src/str/ft_strtrim.c
@@ -0,0 +1,35 @@
+/* ************************************************************************** */
+/*                                                                            */
+/*                                                        :::      ::::::::   */
+/*   ft_strtrim.c                                       :+:      :+:    :+:   */
+/*                                                    +:+ +:+         +:+     */
+/*   By: hulamy <marvin@42.fr>                      +#+  +:+       +#+        */
+/*                                                +#+#+#+#+#+   +#+           */
+/*   Created: 2018/11/14 21:20:09 by hulamy            #+#    #+#             */
+/*   Updated: 2019/03/25 15:12:04 by hulamy           ###   ########.fr       */
+/*                                                                            */
+/* ************************************************************************** */
+
+/*
+** create a copy of s without the firsts and lasts empty characters
+*/
+
+#include "libft.h"
+
+char		*ft_strtrim(char const *s)
+{
+	int		len;
+	char	*str;
+
+	if (!s)
+		return (NULL);
+	while (*s == ' ' || *s == '\t' || *s == '\n')
+		s++;
+	len = ft_strlen(s) - 1;
+	while (len >= 0 && (s[len] == ' ' || s[len] == '\t' || s[len] == '\n'))
+		len--;
+	len++;
+	if (!(str = ft_strsub(s, 0, len)))
+		return (NULL);
+	return (str);
+}
--- a/libft/src/tab/ft_any.c
+++ b/libft/src/tab/ft_any.c
@@ -0,0 +1,26 @@
+/* ************************************************************************** */
+/*                                                                            */
+/*                                                        :::      ::::::::   */
+/*   ft_any.c                                           :+:      :+:    :+:   */
+/*                                                    +:+ +:+         +:+     */
+/*   By: hulamy <marvin@42.fr>                      +#+  +:+       +#+        */
+/*                                                +#+#+#+#+#+   +#+           */
+/*   Created: 2018/11/16 15:14:49 by hulamy            #+#    #+#             */
+/*   Updated: 2018/11/16 15:14:53 by hulamy           ###   ########.fr       */
+/*                                                                            */
+/* ************************************************************************** */
+
+#include "libft.h"
+
+int		ft_any(char **tab, int (*f)(char*))
+{
+	int i;
+
+	i = -1;
+	if (!tab)
+		return (0);
+	while (tab[++i])
+		if (f(tab[i]) == 1)
+			return (1);
+	return (0);
+}
--- a/libft/src/tab/ft_arraymap.c
+++ b/libft/src/tab/ft_arraymap.c
@@ -0,0 +1,28 @@
+/* ************************************************************************** */
+/*                                                                            */
+/*                                                        :::      ::::::::   */
+/*   ft_arraymap.c                                      :+:      :+:    :+:   */
+/*                                                    +:+ +:+         +:+     */
+/*   By: hulamy <marvin@42.fr>                      +#+  +:+       +#+        */
+/*                                                +#+#+#+#+#+   +#+           */
+/*   Created: 2018/11/16 15:17:24 by hulamy            #+#    #+#             */
+/*   Updated: 2018/11/16 15:17:27 by hulamy           ###   ########.fr       */
+/*                                                                            */
+/* ************************************************************************** */
+
+#include "libft.h"
+
+int		*ft_arraymap(int *tab, int length, int (*f)(int))
+{
+	int	i;
+	int	*newtab;
+
+	i = -1;
+	if (!tab)
+		return (NULL);
+	if (!(newtab = (int*)malloc(sizeof(*newtab) * (length + 1))))
+		return (NULL);
+	while (++i < length)
+		newtab[i] = (*f)(tab[i]);
+	return (newtab);
+}
--- a/libft/src/tab/ft_foreach.c
+++ b/libft/src/tab/ft_foreach.c
@@ -0,0 +1,22 @@
+/* ************************************************************************** */
+/*                                                                            */
+/*                                                        :::      ::::::::   */
+/*   ft_foreach.c                                       :+:      :+:    :+:   */
+/*                                                    +:+ +:+         +:+     */
+/*   By: hulamy <marvin@42.fr>                      +#+  +:+       +#+        */
+/*                                                +#+#+#+#+#+   +#+           */
+/*   Created: 2018/11/16 15:16:10 by hulamy            #+#    #+#             */
+/*   Updated: 2018/11/16 15:16:11 by hulamy           ###   ########.fr       */
+/*                                                                            */
+/* ************************************************************************** */
+
+#include "libft.h"
+
+void	ft_foreach(int *tab, int length, void (*f)(int))
+{
+	int	i;
+
+	i = 0;
+	while (i < length && tab && tab[i])
+		(*f)(tab[i++]);
+}
--- a/libft/src/trsf/ft_atoi.c
+++ b/libft/src/trsf/ft_atoi.c
@@ -0,0 +1,39 @@
+/* ************************************************************************** */
+/*                                                                            */
+/*                                                        :::      ::::::::   */
+/*   ft_atoi.c                                          :+:      :+:    :+:   */
+/*                                                    +:+ +:+         +:+     */
+/*   By: hulamy <marvin@42.fr>                      +#+  +:+       +#+        */
+/*                                                +#+#+#+#+#+   +#+           */
+/*   Created: 2018/11/14 21:09:04 by hulamy            #+#    #+#             */
+/*   Updated: 2018/11/14 21:38:12 by hulamy           ###   ########.fr       */
+/*                                                                            */
+/* ************************************************************************** */
+
+#include "libft.h"
+
+int		ft_atoi(const char *str)
+{
+	long long	nbr;
+	int			i;
+	int			n;
+
+	i = 0;
+	n = 1;
+	nbr = 0;
+	while ((str[i] == 32) || (str[i] > 8 && str[i] < 14))
+		i++;
+	if (str[i] == '-')
+		n = -1;
+	if (str[i] == '+' || str[i] == '-')
+		i++;
+	while (str[i] >= '0' && str[i] <= '9')
+	{
+		if ((nbr >= 922337203685477580
+						&& ((str[i] > 8 && n < 0) || (str[i] > 7 && n > 0))))
+			return ((n > 0) ? -1 : 0);
+		else
+			nbr = nbr * 10 + (str[i++] - '0');
+	}
+	return (nbr * n);
+}
--- a/libft/src/trsf/ft_atoibase.c
+++ b/libft/src/trsf/ft_atoibase.c
@@ -0,0 +1,75 @@
+/* ************************************************************************** */
+/*                                                                            */
+/*                                                        :::      ::::::::   */
+/*   ft_atoibase.c                                      :+:      :+:    :+:   */
+/*                                                    +:+ +:+         +:+     */
+/*   By: hulamy <marvin@42.fr>                      +#+  +:+       +#+        */
+/*                                                +#+#+#+#+#+   +#+           */
+/*   Created: 2018/11/16 15:15:31 by hulamy            #+#    #+#             */
+/*   Updated: 2018/11/16 15:22:34 by hulamy           ###   ########.fr       */
+/*                                                                            */
+/* ************************************************************************** */
+
+#include "libft.h"
+
+static int	is_valid_base(char *base, int i, int j)
+{
+	while (base[i])
+	{
+		j = i + 1;
+		while (base[j])
+		{
+			if (base[i] == base[j])
+				return (0);
+			j++;
+		}
+		if (base[i] == '-' || base[i] == '+')
+			return (0);
+		i++;
+	}
+	if (i >= 2)
+		return (1);
+	return (0);
+}
+
+static int	skip(int i, char *str, int *n)
+{
+	while ((str[i] == 32) || (str[i] > 8 && str[i] < 14))
+		i++;
+	if (str[i] == '+' || str[i] == '-')
+	{
+		if (str[i] == '-')
+			*n = -1;
+		i++;
+	}
+	return (i);
+}
+
+int			ft_atoibase(char *str, char *base)
+{
+	int i;
+	int j;
+	int length;
+	int res;
+	int n;
+
+	length = 0;
+	res = 0;
+	n = 1;
+	if (!is_valid_base(base, 0, 0))
+		return (0);
+	while (base[length])
+		length++;
+	i = skip(0, str, &n);
+	while (str[i] && str[i] > 32 && str[i] != '-' && str[i] != '+')
+	{
+		j = 0;
+		while (str[i] != base[j] && base[j])
+			j++;
+		if (base[j] == '\0')
+			return (0);
+		res = (res * length) + j;
+		i++;
+	}
+	return (res * n);
+}
--- a/libft/src/trsf/ft_bzero.c
+++ b/libft/src/trsf/ft_bzero.c
@@ -0,0 +1,27 @@
+/* ************************************************************************** */
+/*                                                                            */
+/*                                                        :::      ::::::::   */
+/*   ft_bzero.c                                         :+:      :+:    :+:   */
+/*                                                    +:+ +:+         +:+     */
+/*   By: hulamy <marvin@42.fr>                      +#+  +:+       +#+        */
+/*                                                +#+#+#+#+#+   +#+           */
+/*   Created: 2018/11/14 21:09:19 by hulamy            #+#    #+#             */
+/*   Updated: 2018/11/15 21:43:05 by hulamy           ###   ########.fr       */
+/*                                                                            */
+/* ************************************************************************** */
+
+#include "libft.h"
+
+void	ft_bzero(void *s, size_t n)
+{
+	size_t			i;
+	unsigned char	*ptr;
+
+	if (n)
+	{
+		ptr = (unsigned char *)s;
+		i = 0;
+		while (i < n)
+			ptr[i++] = '\0';
+	}
+}
--- a/libft/src/trsf/ft_convertbase.c
+++ b/libft/src/trsf/ft_convertbase.c
@@ -0,0 +1,86 @@
+/* ************************************************************************** */
+/*                                                                            */
+/*                                                        :::      ::::::::   */
+/*   ft_convertbase.c                                   :+:      :+:    :+:   */
+/*                                                    +:+ +:+         +:+     */
+/*   By: hulamy <marvin@42.fr>                      +#+  +:+       +#+        */
+/*                                                +#+#+#+#+#+   +#+           */
+/*   Created: 2018/11/16 15:15:55 by hulamy            #+#    #+#             */
+/*   Updated: 2019/04/17 17:09:35 by hulamy           ###   ########.fr       */
+/*                                                                            */
+/* ************************************************************************** */
+
+#include "libft.h"
+
+static int	ft_malloc_size(int decimal, int length, int i)
+{
+	if (decimal <= 0)
+		i++;
+	while (decimal)
+	{
+		decimal /= length;
+		i++;
+	}
+	return (i);
+}
+
+static char	*ft_decimal_to_base(int decimal, char *base, char *res, int size)
+{
+	long	nb;
+	int		i;
+
+	nb = decimal;
+	i = 0;
+	while (base[i])
+		i++;
+	if (nb < 0)
+		nb = -nb;
+	while (--size >= 0)
+	{
+		res[size] = base[nb % i];
+		nb /= i;
+	}
+	return (res);
+}
+
+static int	ft_base_to_decimal(char *nbr, char *base, int length, int i)
+{
+	long	decimal;
+	int		j;
+
+	decimal = 0;
+	if (nbr[i] == '-')
+		i++;
+	while (nbr[i])
+	{
+		j = 0;
+		while (nbr[i] != base[j] && base[j])
+			j++;
+		decimal = (decimal * length) + j;
+		i++;
+	}
+	if (nbr[0] == '-')
+		decimal = -decimal;
+	return (decimal);
+}
+
+char		*ft_convertbase(char *nbr, char *base_from, char *base_to)
+{
+	int		length;
+	int		size;
+	int		decimal;
+	char	*res;
+
+	res = 0;
+	length = 0;
+	while (base_from[length])
+		length++;
+	decimal = ft_base_to_decimal(nbr, base_from, length, 0);
+	length = 0;
+	while (base_to[length])
+		length++;
+	size = ft_malloc_size(decimal, length, 0);
+	res = (char *)malloc(sizeof(char) * (size + 1));
+	res[size] = '\0';
+	return (ft_decimal_to_base(decimal, base_to, res, size));
+}
--- a/libft/src/trsf/ft_itoa.c
+++ b/libft/src/trsf/ft_itoa.c
@@ -0,0 +1,35 @@
+/* ************************************************************************** */
+/*                                                                            */
+/*                                                        :::      ::::::::   */
+/*   ft_itoa.c                                          :+:      :+:    :+:   */
+/*                                                    +:+ +:+         +:+     */
+/*   By: hulamy <marvin@42.fr>                      +#+  +:+       +#+        */
+/*                                                +#+#+#+#+#+   +#+           */
+/*   Created: 2018/11/14 21:10:25 by hulamy            #+#    #+#             */
+/*   Updated: 2018/11/14 21:36:38 by hulamy           ###   ########.fr       */
+/*                                                                            */
+/* ************************************************************************** */
+
+#include "libft.h"
+
+char			*ft_itoa(int n)
+{
+	char		*str;
+	int			len;
+	long int	nbis;
+
+	len = (n < 0) ? 2 : 1;
+	nbis = n;
+	while (nbis /= 10)
+		len++;
+	nbis = n;
+	nbis *= (nbis < 0) ? -1 : 1;
+	if (!(str = ft_strnew(len)))
+		return (NULL);
+	str[--len] = nbis % 10 + '0';
+	while (nbis /= 10)
+		str[--len] = nbis % 10 + '0';
+	if (n < 0)
+		str[0] = '-';
+	return (str);
+}
--- a/libft/src/trsf/ft_tolower.c
+++ b/libft/src/trsf/ft_tolower.c
@@ -0,0 +1,20 @@
+/* ************************************************************************** */
+/*                                                                            */
+/*                                                        :::      ::::::::   */
+/*   ft_tolower.c                                       :+:      :+:    :+:   */
+/*                                                    +:+ +:+         +:+     */
+/*   By: hulamy <marvin@42.fr>                      +#+  +:+       +#+        */
+/*                                                +#+#+#+#+#+   +#+           */
+/*   Created: 2018/11/14 21:20:19 by hulamy            #+#    #+#             */
+/*   Updated: 2018/11/14 21:20:20 by hulamy           ###   ########.fr       */
+/*                                                                            */
+/* ************************************************************************** */
+
+#include "libft.h"
+
+int		ft_tolower(int c)
+{
+	if (c >= 'A' && c <= 'Z')
+		return (c + 32);
+	return (c);
+}
--- a/libft/src/trsf/ft_toupper.c
+++ b/libft/src/trsf/ft_toupper.c
@@ -0,0 +1,20 @@
+/* ************************************************************************** */
+/*                                                                            */
+/*                                                        :::      ::::::::   */
+/*   ft_toupper.c                                       :+:      :+:    :+:   */
+/*                                                    +:+ +:+         +:+     */
+/*   By: hulamy <marvin@42.fr>                      +#+  +:+       +#+        */
+/*                                                +#+#+#+#+#+   +#+           */
+/*   Created: 2018/11/14 21:20:26 by hulamy            #+#    #+#             */
+/*   Updated: 2018/11/14 21:20:27 by hulamy           ###   ########.fr       */
+/*                                                                            */
+/* ************************************************************************** */
+
+#include "libft.h"
+
+int		ft_toupper(int c)
+{
+	if (c >= 'a' && c <= 'z')
+		return (c - 32);
+	return (c);
+}
--- a/main.c
+++ b/main.c
@@ -6,32 +6,109 @@
 /*   By: vmanzoni <vmanzoni@student.42.fr>          +#+  +:+       +#+        */
 /*                                                +#+#+#+#+#+   +#+           */
 /*   Created: 2019/02/12 13:20:48 by vmanzoni          #+#    #+#             */
-/*   Updated: 2019/04/15 20:54:24 by vmanzoni         ###   ########.fr       */
+/*   Updated: 2019/06/01 15:27:22 by vmanzoni         ###   ########.fr       */
 /*                                                                            */
 /* ************************************************************************** */

 #include "fillit.h"

-int		main(int argc, char **argv)
-{
-	char	*input;
+/*
+** Function that put the flags for bonus into a tab of int
+**
+** d : debug print (print the map during the backtracking)
+** o : optimisation ultra fast but with some errors still
+** p : print extended (print the tetri and the map in different formats)
+** e : error extended (message more precise AND no error if too much tetri)
+*/

-	if (argc == 2)
+int		*create_dope(char *av, int mdp)
+{
+	char	*comp;
+	int		*dope;
+	int		i;
+	int		j;
+
+	comp = "dope";
+	if (!(dope = (int*)malloc(sizeof(*dope) * 4)))
+		return (0);
+	i = 0;
+	while (i < 4)
+		dope[i++] = 0;
+	if (!mdp)
+		return (dope);
+	i = -1;
+	while (++i < 4 && (j = -1))
+		while (av[++j])
+			if (comp[i] == av[j])
+				dope[i] = 1;
+	return (dope);
+}
+
+/*
+** Function that check if the password is good to unlock the flags
+*/
+
+int		is_mdp(int ac, char **av)
+{
+	char	*mdp;
+	int		i;
+
+	if (ac < 3 || ac > 4)
+		return (0);
+	mdp = "trompette";
+	i = 0;
+	while (av[2][i] && mdp[i] && mdp[i] == av[2][i])
+		i++;
+	if (av[2][i] || mdp[i])
+		return (0);
+	if (ac == 3)
+		return (print_flags_usage());
+	return (1);
+}
+
+/*
+** Function that free the list
+*/
+
+void	clean_list(t_fillist *list, t_fillist *tmp)
+{
+	tmp = list;
+	while (list)
 	{
-		if (!(input = read_file(argv[1])))
-			print_error("Error: Could not read file.\n");
-		if (check_file_errors(input))
-			print_error("Error: Invalid file.\n");
-		parse_input(input);
-		/*
-		Transform input to tetriminos
-		Backtracking for smallest square
-		Transform tetriminos with letters
-		Print result
-		*/
-		//print_test(input);
+		list = tmp->next;
+		free(tmp->memory);
+		free(tmp);
+		tmp = list;
+	}
+}
+
+/*
+** Main function
+*/
+
+int		main(int ac, char **av)
+{
+	t_fillist	*list;
+	char		*input;
+	int			*dope;
+	int			size;
+	int			mdp;
+
+	list = NULL;
+	mdp = is_mdp(ac, av);
+	dope = create_dope(av[3], mdp);
+	if (ac == 2 || mdp)
+	{
+		if (!(input = read_file(av[1])))
+			print_error(dope[3] ? "error: Could not read file.\n" : "error\n");
+		check_file_errors(input, dope);
+		size = parse_input(input, &list, dope);
+		print_final_map(list, size);
+		free(input);
+		clean_list(list, list);
 	}
 	else
-		print_error("Usage: Please submit a file.\n");
+		print_error("usage: Please submit a file.\n> ./fillit file.fillit\n");
+	free(dope);
 	return (0);
 }
--- a/parse_input.c
+++ b/parse_input.c
@@ -1,77 +0,0 @@
-/* ************************************************************************** */
-/*                                                                            */
-/*                                                        :::      ::::::::   */
-/*   parse_input.c                                      :+:      :+:    :+:   */
-/*                                                    +:+ +:+         +:+     */
-/*   By: vmanzoni <vmanzoni@student.42.fr>          +#+  +:+       +#+        */
-/*                                                +#+#+#+#+#+   +#+           */
-/*   Created: 2019/04/15 14:48:14 by vmanzoni          #+#    #+#             */
-/*   Updated: 2019/04/16 15:28:11 by hulamy           ###   ########.fr       */
-/*                                                                            */
-/* ************************************************************************** */
-
-#include "fillit.h"
-
-/*
-** Function that parse a file and put each tetrimino in a linked list
-*/
-
-char	**create_square(char *tetri)
-{
-	char	**square;
-	int		i;
-	int		k;
-
-	i = 0;
-	if (!(square = (char**)malloc(sizeof(*square) * 4)))
-		return (NULL);
-	while (*tetri && (k = -1))
-	{
-		if (!(square[i] = (char*)malloc(sizeof(**square) * (4 + 1))))
-			return (NULL);
-		square[i][4] = '\0';
-		while (++k < 4)
-			square[i][k] = *(tetri++);
-		while (*tetri == '\n')
-			tetri++;
-	//	printf("%s\n", square[i]);
-		i++;
-	}
-	return (square);
-}
-
-void	parse_input(char *input)
-{
-	static t_fillist	*list = NULL;
-	char				tetri[20];
-	int					i;
-	int					j;
-	char **test;
-
-	i = 0;
-	while (input[i])
-	{
-		j = 0;
-		while (j < 19)
-			tetri[j++] = input[i++];
-		tetri[19] = '\0';
-		//printf("PRINT:\n%s\n", tetri);
-		if (check_tetri_errors(tetri))
-			print_error("Error: Tetrimino not valid.");
-		test = create_square(tetri);
-		add_to_list(test, &list);
-		while (input[i] == '\n')
-			i++;
-	}
-	/*
-	** ce qui suit sert juste a afficher le contenu de tous les tetraminos de la liste chainee
-	** pour debug, a effacer au rendu
-	*/
-	while (list && (i = -1))
-	{
-		while (++i < list->size[1])
-			printf("%s\n", list->tetraminos[i]);
-		printf("\n");
-		list = list->next;
-	}
-}
--- a/samples/16square
+++ b/samples/16square
@@ -0,0 +1,79 @@
+##..
+##..
+....
+....
+
+##..
+##..
+....
+....
+
+##..
+##..
+....
+....
+
+##..
+##..
+....
+....
+
+##..
+##..
+....
+....
+
+##..
+##..
+....
+....
+
+##..
+##..
+....
+....
+
+##..
+##..
+....
+....
+
+##..
+##..
+....
+....
+
+##..
+##..
+....
+....
+
+##..
+##..
+....
+....
+
+##..
+##..
+....
+....
+
+##..
+##..
+....
+....
+
+##..
+##..
+....
+....
+
+##..
+##..
+....
+....
+
+##..
+##..
+....
+....
--- a/samples/1full
+++ b/samples/1full
@@ -0,0 +1,4 @@
+####
+####
+####
+####
--- a/samples/1square
+++ b/samples/1square
--- a/samples/1tetri
+++ b/samples/1tetri
@@ -1,4 +1,4 @@
-...#
-...#
-...#
-...#
+#...
+#...
+#...
+#...
--- a/samples/1tetri_T
+++ b/samples/1tetri_T
@@ -1,4 +1,4 @@
+###.
+.#..
 ....
 ....
-....
-####
--- a/samples/1tetri_wrong
+++ b/samples/1tetri_wrong
@@ -0,0 +1,4 @@
+#...
+.#..
+#...
+#...
--- a/Show More
+++ b/Show More
Author	SHA1	Message	Date
pia Lepetit	aa8a80b831	sauvegarde avant depart	2019-06-04 18:08:48 +02:00
pia Lepetit	0e52943b34	deux opti ilots et identiques	2019-06-04 16:56:24 +02:00
pia Lepetit	602ebf070d	ajout de l'effacement selectif lors de l'opti, pas ouf ouf	2019-06-03 08:16:18 +02:00
Hugo LAMY	f1471562f3	makefile lance la libft aussi	2019-06-01 17:00:52 +02:00
Hugo LAMY	58490cfb56	pret a rendre	2019-06-01 16:27:26 +02:00
Hugo LAMY	214dc0dc5c	tout foncioooooone	2019-06-01 16:25:29 +02:00
Manzovince	47fcd0ec91	free bonus print	2019-06-01 16:25:28 +02:00
Hugo LAMY	ee2620e540	tout foncioooooone	2019-06-01 16:23:27 +02:00
Hugo LAMY	26a9c9cbac	merge a la main c pas bien	2019-06-01 16:05:47 +02:00
Hugo LAMY	d7dc746779	catastrophe merge	2019-06-01 16:00:49 +02:00
Hugo LAMY	c81b7515be	clean pour merge	2019-06-01 15:58:31 +02:00
Manzovince	c007a8299a	handle error correct	2019-06-01 15:53:43 +02:00
Manzovince	fd696fc499	oubli dans le main.c	2019-06-01 15:27:46 +02:00
Manzovince	bfe7658388	Merge remote-tracking branch 'origin/ralentit'	2019-06-01 15:17:58 +02:00
Hugo LAMY	5bdc944da9	dernier leaks disparu avec nouvelle fonction dans read_file	2019-06-01 15:13:08 +02:00
Manzovince	482861a3c9	Auto stash before merge of "master" and "origin/ralentit"	2019-06-01 14:54:12 +02:00
Manzovince	5d4de7718e	Merge remote-tracking branch 'origin/ralentit'	2019-06-01 14:52:37 +02:00
Hugo LAMY	f29d9d8e60	a la norme et flag e enleve la limite de 26 tetri	2019-06-01 14:49:30 +02:00
Hugo LAMY	2d06dcf837	merging ralentit branch	2019-06-01 14:08:35 +02:00
Manzovince	0c48e90449	Merge branch 'ralentit'	2019-06-01 14:04:23 +02:00
Manzovince	68bac851e2	free(map) in print_binary_map - Auto stash before rebase of "origin/master"	2019-06-01 14:03:37 +02:00
Hugo LAMY	f79d3812d0	il ne reste qu'un seul leaks	2019-06-01 13:57:39 +02:00
Hugo LAMY	56ca478503	version sans erreurs de valgrind autre que trois leaks	2019-06-01 13:47:21 +02:00
Hugo LAMY	27afcbe7e9	tentative d'enlever les leaks en cours	2019-06-01 12:36:34 +02:00
Hugo LAMY	04a4fef38b	les sames ne s'impriment pas avec juste le flag p mais seulement le o en plus	2019-05-29 16:36:04 +02:00
Hugo LAMY	e7e944f1ac	derniere erreur de valgrind resolu mais a tester sur les mauvais tetri	2019-05-29 15:53:08 +02:00
Hugo LAMY	819a14407d	derniere erreur de valgrind resolu mais a tester sur les mauvais tetri	2019-05-29 15:51:41 +02:00
Manzovince	2bc1f50b46	README edit	2019-05-29 15:44:36 +02:00
Manzovince	7a07d84d6c	README and few little corrections on code readability	2019-05-29 15:42:31 +02:00
Manzovince	0236573b6d	all debug comments deleted for norm	2019-05-29 13:57:37 +02:00
Manzovince	fb1a41e94f	correction of handle_errors.c (1 error still not solved) Quand on a une nl après le dernier tetrimino du fichier input, on devrait sortir une erreur au lieu de résoudre le fillit	2019-05-29 13:52:41 +02:00
Manzovince	6ca294272f	.dSYM deleted	2019-05-29 13:37:34 +02:00
Manzovince	bfd23d6211	gitignore edit for libft symlink	2019-05-29 13:37:13 +02:00
Manzovince	fa5f2e7f00	new version of fillit.h with details	2019-05-29 13:36:40 +02:00
Manzovince	246906a490	all test files grouped in folder	2019-05-29 13:15:53 +02:00
Manzovince	eea8110abd	correction on main.c (working for me now)	2019-05-29 13:12:31 +02:00
Manzovince	79a5fb188c	correction on fillit.h	2019-05-29 13:10:21 +02:00
Manzovince	59d2be2756	Merge remote-tracking branch 'origin/master'	2019-05-29 11:35:00 +02:00
Hugo LAMY	c82ba9bccb	presque toutes les erreures de vlgrind resolues, sauf une derniere dans error_proxy	2019-05-28 19:36:21 +02:00
Hugo LAMY	ed06e3eb8e	corrige deux bad read or write due au depassement de la taille de map, en ajoutant total_num dans la struct	2019-05-28 17:35:34 +02:00
Manzovince	2dfe395a9b	Merge remote-tracking branch 'origin/master'	2019-05-28 13:23:15 +02:00
Hugo LAMY	77656ba113	sans l'opion o opti les sames ne s'affichent pas	2019-05-28 13:05:14 +02:00
Hugo LAMY	a9e62833bb	flags organises	2019-05-27 19:53:27 +02:00
Hugo LAMY	6b9936b0cd	en cours de reorganisation des fichiers pour gerer les flags	2019-05-24 18:05:18 +02:00
Hugo LAMY	1a16e305d3	a une ligne pret le programme fonctionne tout le temps aaaarg	2019-05-21 15:31:04 +02:00
Hugo LAMY	1811268725	fillit ultrrrrrrra rapide ! pas encore a la norme	2019-05-20 15:58:45 +02:00
Manzovince	184981a28d	Merge remote-tracking branch 'origin/master'	2019-05-20 15:52:43 +02:00
Hugo LAMY	c2e87b7303	opti fonctionne super bien et super mal	2019-05-20 15:42:30 +02:00
Manzovince	2dbd5b7320	Auto stash before merge of "master" and "origin/master" + CLEANING	2019-05-20 13:53:01 +02:00
Hugo LAMY	0912e52a7a	clean les comments	2019-05-18 15:34:47 +02:00
Hugo LAMY	f4b1da414c	list s'imprime dans main	2019-05-17 18:43:33 +02:00
Hugo LAMY	94c0e5d57f	search_map a la norme	2019-05-17 17:13:31 +02:00
Hugo LAMY	e5aea30023	backtracking fonctionne avec list->position directement	2019-05-16 16:51:09 +02:00
Hugo LAMY	6705bf9133	version clean sans modulos et divisions pour find_place	2019-05-15 18:05:37 +02:00
Hugo LAMY	2e53b04a9a	optimisation en virant modulos et divisions semble marcher, gagne 10s	2019-05-15 17:47:32 +02:00
Manzovince	a639da4ac5	New test opti, strange behavior	2019-05-13 21:48:00 +02:00
Manzovince	b9bdc14db7	New samples added + First Try Optimisation	2019-05-13 18:26:39 +02:00
Hugo LAMY	af527c6316	fonctionne mais sans optimisation	2019-05-10 20:46:02 +02:00
Hugo LAMY	aa8ec6fe66	tentative echouee d'oter les modulo et division dans le fit_in_place	2019-05-10 20:40:16 +02:00
Hugo LAMY	213eff3255	rate pour l'opti qui ralenti mais find_place divisee avec fit_in_place	2019-05-10 17:00:55 +02:00
Hugo LAMY	67cb5dea38	en cours decriture de check_others	2019-05-09 18:04:08 +02:00
Manzovince	8a62783a6b	WORKING VERSION FOR 42FileChecker test. All test passed !	2019-05-09 12:46:59 +02:00
Manzovince	1c6e41e8bf	4 new samples for testing	2019-05-09 12:45:57 +02:00
Hugo LAMY	3977a73682	resolu les deux problemes de add_remove et find_place mais bcp bcp plus lent	2019-05-08 18:45:21 +02:00
Hugo LAMY	2738a5e24b	plus de decalage a gauche mais bcp plus lent	2019-05-08 18:43:34 +02:00
Hugo LAMY	1ff7abafd6	rajout d'un if dans add_remove pour resoudre la superposition des ints	2019-05-08 17:55:38 +02:00
Manzovince	4a7ad39626	new samples + map_color modified	2019-05-08 15:42:49 +02:00
Manzovince	fe191054c9	New handle_errors and cleaner print_map_with_colors	2019-05-08 08:10:09 +02:00
Hugo LAMY	d057ef941b	sans les codes de debug	2019-05-06 23:29:04 +02:00
Hugo LAMY	23c9e19ea6	map resolue mais peut-etre pas la meilleur solution	2019-05-06 23:24:24 +02:00
Hugo LAMY	74ef38e23a	a priori le find place ne deborde plus a droite	2019-05-06 20:26:27 +02:00
Hugo LAMY	60d1d87b76	add_remove decidement.. semble fonctionner mieux mais avec deux modulo a chaque boucles	2019-05-06 20:04:27 +02:00
Hugo LAMY	e784b96efe	imprime les lettres en couleur lors du debug	2019-05-06 16:35:16 +02:00
Hugo LAMY	b85454473d	imprime les lettres pendant la recursive pour debug	2019-05-06 16:28:23 +02:00
Manzovince	6558b77ef2	Edit print_color for every tetri working	2019-05-04 19:16:38 +02:00
Manzovince	7872fac59e	edit in fillit.h and print.c for color map feature	2019-05-04 19:10:33 +02:00
Manzovince	c1850f3fd6	Adding new ft for printing map with colors, WORKING	2019-05-04 19:09:25 +02:00
Manzovince	fdb4c53787	map_hard ADDED	2019-05-03 19:27:22 +02:00
Manzovince	1cf791746c	Bonus: Best Error Handler (more details about the error)	2019-05-03 19:13:48 +02:00
Manzovince	8d9b314781	README edit	2019-05-03 18:45:14 +02:00
Manzovince	7d0dab1e1e	Auto stash before merge of "master" and "origin/master"	2019-05-03 18:44:51 +02:00
Hugo LAMY	60b970e901	affiche correctement la map avec les lettres mais la map est fausse donc erreur dans backtracking	2019-05-03 16:11:15 +02:00
Hugo LAMY	671585098f	fonction print_final_map fonctionne mais backtracking bug..	2019-05-03 16:06:11 +02:00
Hugo LAMY	bd38cd52ed	letter ajoute a la struct	2019-05-03 14:25:05 +02:00
Hugo LAMY	192c2ba0ae	ca semble fonctionner et c tres rapide	2019-05-02 16:45:28 +02:00
Hugo LAMY	8a49caad94	find place ne depasse plus les bords de droite et du bas	2019-05-02 00:13:11 +02:00
Hugo LAMY	05e265b3b1	la position des tetri dans la recursive est mtn garde en memoire	2019-05-01 23:46:43 +02:00
Hugo LAMY	929e070fb0	nettoyage et mise a la norme de add_remove	2019-05-01 23:22:14 +02:00
Hugo LAMY	f035f37607	this time add_remove really fucking works	2019-05-01 23:13:24 +02:00
Hugo LAMY	c8570a26f1	add_remove fonctionne vraiment cette fois	2019-05-01 22:50:46 +02:00
Manzovince	37b565f3da	Ajout d'une nouvelle méthode pour les tetris et la map	2019-05-01 20:08:13 +02:00
Manzovince	2291152158	new samples	2019-05-01 20:05:44 +02:00
Hugo LAMY	527b621526	merging the clean branch with recursive working badly	2019-05-01 14:25:01 +02:00
Hugo LAMY	0e6e4a3caa	merge conflict ave fillit	2019-05-01 14:23:53 +02:00
Hugo LAMY	c118eac450	debug de la recursive et add_remove qui foire certains bits	2019-05-01 14:22:18 +02:00
Hugo LAMY	646d611381	add_remove fonctionne	2019-05-01 13:49:19 +02:00
Hugo LAMY	c40da94786	add_remove fonctionne pour adding	2019-05-01 12:34:58 +02:00
Hugo LAMY	c50f971f50	continue de tenter d'ecrire le add_remove mask	2019-04-30 20:59:01 +02:00
Manzovince	7b26fc7feb	adding a print_tetri function in print.c for testing	2019-04-30 19:51:28 +02:00
Manzovince	5dd491ed52	few little edits + show wrong tetri feature	2019-04-30 15:32:47 +02:00
Hugo LAMY	9639bd80e3	correction lien libft et def BUFFSIZE dans fillit.h	2019-04-30 14:25:32 +02:00
Hugo LAMY	4d4ec6d8e0	merge avec nouveau file search_map qui est la recursive et reorganisation du makefile	2019-04-30 14:21:41 +02:00
Hugo LAMY	7e2ef9e878	creer symlink de libft	2019-04-30 14:11:56 +02:00
Hugo LAMY	ef78667474	renomme fichiers en prevision de merge	2019-04-30 14:10:37 +02:00
Hugo LAMY	2363e42167	test add_remove qui ne fonctionne pas encore	2019-04-30 14:08:30 +02:00
Hugo LAMY	ed1cde6e22	modified test_right in test_big_tetri	2019-04-30 13:32:27 +02:00
Hugo LAMY	c7f7ac205c	ajout du fichier print qui contient les fonctinos de print de bits	2019-04-30 13:26:10 +02:00
Hugo LAMY	0eef1b4825	libft en symlink	2019-04-30 13:20:36 +02:00
Hugo LAMY	8967fcb464	some changes to search map	2019-04-30 12:50:20 +02:00
Hugo LAMY	817528c943	makefile delete tous les fichiers .o et .swp et du genre	2019-04-28 16:49:17 +02:00
Hugo LAMY	656973ae52	ebut implementation de la recursive	2019-04-28 16:24:09 +02:00
Hugo LAMY	1dd8a9e8c8	find_place renvois la position du tetri dans la map	2019-04-28 02:24:27 +02:00
Hugo LAMY	003d2b3cbb	recherche de la position du tetri dans la map fonctionne	2019-04-28 01:09:43 +02:00
Manzovince	4f212d598a	main.c print_error modified	2019-04-27 16:43:43 +02:00
Manzovince	12fff81bde	README edit	2019-04-27 16:38:28 +02:00
Manzovince	faae791431	2 new samples for testing feature on check_tetri_errors	2019-04-27 16:33:46 +02:00
Manzovince	3e20319691	Few edits for readability, cleaning + README edit	2019-04-27 15:16:34 +02:00
Manzovince	fa281b58ea	TEST OK - WORKING - Nice job Hugo ;) !	2019-04-27 14:58:30 +02:00
Manzovince	16f98e1a1d	.h, main, Makefile and add_to_list edit for Testing	2019-04-27 14:55:50 +02:00
Manzovince	fc0530a257	test	2019-04-27 14:41:12 +02:00
Hugo LAMY	48576180a2	structure modifiee avec tailles et parsing fonctionne	2019-04-27 02:05:22 +02:00
Hugo LAMY	b5ad1209f4	add_to_list fonctionne pleinement en binaire et creer un vrai tetri reduit et ses dimensions	2019-04-27 02:01:54 +02:00
Hugo LAMY	213cf40eb4	tous les champs de t_fillist remplis	2019-04-25 18:46:52 +02:00
Hugo LAMY	c83ac7599d	tous les champs de list remplis	2019-04-25 18:45:21 +02:00
Hugo LAMY	e1f4ebee2a	la recherche du tetri qui rentre dans la map fonctionne avec plusieurs tailles	2019-04-25 16:29:17 +02:00
Hugo LAMY	4007f0d707	la recherche du tetri qui rentre dans la map fonctionne avec toutes les tailles de tetri	2019-04-25 16:25:26 +02:00
Hugo LAMY	51205f5c56	test_big_tetri.c mis a jour ainsi que parse_input avec le add_to_list integre	2019-04-25 15:11:26 +02:00
Hugo LAMY	ac29587a10	nettoye parse_input avec add_to_list a l'interieur	2019-04-25 15:00:32 +02:00
Hugo LAMY	23ec23f8bc	boucle cherche tetra dans map et trouve quand ca fit	2019-04-25 14:46:46 +02:00
Hugo LAMY	33f74f31fc	ajout de test_big_tetri.c et merge conflict	2019-04-25 13:06:34 +02:00
Hugo LAMY	c70803b01b	ajout de test_big_tetri.c	2019-04-25 13:01:47 +02:00
Hugo LAMY	2364b6322a	fonction pour verifier si l'emplacement est libre en cours de construction	2019-04-25 07:06:37 +02:00
Hugo LAMY	dabdd7dbef	print_map fonctionne avec deux versions	2019-04-25 05:32:29 +02:00
Manzovince	2bac429596	bug resolved + few edits	2019-04-24 21:50:51 +02:00
Hugo LAMY	8da1c5bec6	rangement des fichiers tests et makefile	2019-04-24 15:47:42 +02:00
Hugo LAMY	8d9afa579d	reorganise parse_input	2019-04-24 13:53:33 +02:00
Hugo LAMY	ef84335727	corrige le fill_list pour virer les zeros de debut de tetraminos	2019-04-24 13:41:42 +02:00
Hugo LAMY	c2101d3af9	conflict solved	2019-04-24 12:16:01 +02:00
Hugo LAMY	7bf76e5d41	some changes	2019-04-24 12:15:06 +02:00
Manzovince	39a59058ba	Few edit + BUG on bit convertion for tetri starting at top left corner	2019-04-23 21:44:11 +02:00
Manzovince	2c9340c645	Merge remote-tracking branch 'origin/master'	2019-04-23 21:20:19 +02:00
Manzovince	0aa3026f65	Few edits + BUG found on tmp (add_to_list) with some tetriminoes	2019-04-23 21:20:07 +02:00
Manzovince	f4492e2735	Few edits + BUG found on add_to_list with some tetriminoes	2019-04-23 21:15:12 +02:00
Manzovince	21c10a5787	editing few files for readability	2019-04-23 16:17:13 +02:00
Manzovince	acf5aed90e	gitignore, makefile, .h edited	2019-04-23 15:34:21 +02:00
Manzovince	9a463f3358	Merge remote-tracking branch 'origin/master'	2019-04-23 15:25:52 +02:00
Manzovince	952cc5bf22	create_square comments modified	2019-04-23 15:25:40 +02:00
Manzovince	d0de4dcb47	comments modified	2019-04-23 15:25:23 +02:00
Manzovince	b2d291603c	create_square comment modified	2019-04-23 15:21:21 +02:00
Manzovince	6d093e66cc	handle_errors function name modified	2019-04-23 15:19:53 +02:00
Manzovince	02159dc587	get_smallest_square edited + initialize map added (WIP)	2019-04-23 15:19:30 +02:00
Manzovince	704a47684d	files cleaned (WORKING)	2019-04-22 17:12:36 +02:00
Manzovince	3f6f6f249a	little mod (makefile + read_file)	2019-04-22 16:27:46 +02:00
Manzovince	b5f8e37699	Auto stash before merge of "master" and "origin/master"	2019-04-22 15:14:20 +02:00
Hugo LAMY	88b126d3f1	super mask	2019-04-22 14:40:39 +02:00
Hugo LAMY	64464522f0	test_big_map sans utiliser un compteur j pour le tableau d'int	2019-04-22 13:08:58 +02:00
Hugo LAMY	fc69b0242c	fonction test_big_map fonctionne correctement	2019-04-21 13:34:51 +02:00
Hugo LAMY	41f5d6b202	ajout de test_big_map pour faire tourner une grande map sur une petite	2019-04-20 21:01:49 +02:00
Hugo LAMY	bcfe54e614	ajout de test pour faire tourner une grande map sur une petite	2019-04-20 21:00:29 +02:00
Manzovince	1422c8e046	bug resolved	2019-04-19 21:26:02 +02:00
Manzovince	61cab1af7f	Merge remote-tracking branch 'origin/master'	2019-04-19 21:20:29 +02:00
Hugo LAMY	730964a817	modifie add_to_list pour fonctionner avec du binaire	2019-04-19 15:34:05 +02:00
Manzovince	cfa772677c	tetri_to_bit not working but better !	2019-04-18 16:10:35 +02:00
Manzovince	729853cea0	New function convert tetri to bits ! BUT NOT WORKING :(	2019-04-18 13:09:11 +02:00
Manzovince	15bbf591e8	Makefile cleaned (ft instead of *.c)	2019-04-18 13:08:44 +02:00
Manzovince	851622dc93	print_test ft deleted (not used anymore)	2019-04-18 11:47:42 +02:00
Hugo LAMY	041aa6c9b5	merging solve conflict	2019-04-18 10:56:55 +02:00
Hugo LAMY	4462517caf	merging to push test bits	2019-04-18 10:55:16 +02:00
Manzovince	de86161fcd	Comments Updated (no change in the code)	2019-04-16 16:42:19 +02:00
Manzovince	7dfe29b224	Makefile cleaned (comments deleted + all aligned)	2019-04-16 16:39:37 +02:00
Manzovince	67ec57fd3d	parse_input little edit (printf() deleted)	2019-04-16 16:26:17 +02:00
Hugo LAMY	f592c3cede	met le dernier element du char** a null dans add_to_list et parse	2019-04-16 16:09:09 +02:00
Hugo LAMY	e9d29e6dc1	code qui parse bien les fichiers et gere les erreurs	2019-04-16 15:55:34 +02:00
Hugo LAMY	301d2ba5fb	prepare pour merge	2019-04-16 15:35:16 +02:00