fonction fillsolution remplis les lignes dans le bon sens
This commit is contained in:
39
srcs/print.c
39
srcs/print.c
@@ -2,15 +2,23 @@
|
||||
|
||||
/*
|
||||
** this function is called by actions like sa()
|
||||
** it fills a new element on the chained list like this :
|
||||
** name!a: nb nb nb nb nb!b: nb nb nb
|
||||
** it fills a new str element on the chained list like this :
|
||||
**
|
||||
** it will later be printed like this ("!" is the char to split) :
|
||||
** name
|
||||
** a: nb nb nb nb nb
|
||||
** b: nb nb nb
|
||||
** b: nbb3 nbb2 nbb1!a: nba5 nba4 nba3 nba2 nba1!name
|
||||
** (it fills it by the end, "!name" first, then "nba1" on its back, and so on)
|
||||
**
|
||||
** or only "name" if no flag -p
|
||||
** so it can later be printed like that (in case of flag -p) :
|
||||
** the "!" split the str :
|
||||
**
|
||||
** [0]b: nbb3 nbb2 nbb1 [1]a: nba5 nba4 nba3 nba2 nba1 [2]name
|
||||
**
|
||||
** to produce :
|
||||
**
|
||||
** [2]name
|
||||
** [1] a: nba5 nba4 nba3 nba2 nba1
|
||||
** [0] b: nbb3 nbb2 nbb1
|
||||
**
|
||||
** (if no flag -p, only [2]name is displayed)
|
||||
*/
|
||||
void fill_solution(t_list *solution, char *sp)
|
||||
{
|
||||
@@ -20,20 +28,21 @@ void fill_solution(t_list *solution, char *sp)
|
||||
|
||||
a = *(t_stack **)(solution->content);
|
||||
b = *(t_stack **)(solution->next->content);
|
||||
stack = ft_strjoinfree(ft_strdup(sp), ft_strdup("!a:"));
|
||||
stack = ft_strjoinfree(ft_strdup("!"), ft_strdup(sp));
|
||||
while (a != NULL)
|
||||
{
|
||||
stack = ft_strjoinfree(stack, ft_strdup(" "));
|
||||
stack = ft_strjoinfree(stack, ft_itoa(a->n));
|
||||
stack = ft_strjoinfree(ft_itoa(a->n), stack);
|
||||
stack = ft_strjoinfree(ft_strdup(" "), stack);
|
||||
a = a->next;
|
||||
}
|
||||
stack = ft_strjoinfree(stack, ft_strdup("!b:"));
|
||||
stack = ft_strjoinfree(ft_strdup("!a:"), stack);
|
||||
while (b != NULL)
|
||||
{
|
||||
stack = ft_strjoinfree(stack, ft_strdup(" "));
|
||||
stack = ft_strjoinfree(stack, ft_itoa(b->n));
|
||||
stack = ft_strjoinfree(ft_itoa(b->n), stack);
|
||||
stack = ft_strjoinfree(ft_strdup(" "), stack);
|
||||
b = b->next;
|
||||
}
|
||||
stack = ft_strjoinfree(ft_strdup("b:"), stack);
|
||||
ft_lstadd_back(&solution, ft_lstnew(stack));
|
||||
}
|
||||
|
||||
@@ -48,11 +57,11 @@ void print_result(t_list *result, int flag)
|
||||
{
|
||||
i++;
|
||||
part = ft_split(result->content, '!');
|
||||
ft_printf("%s\n", part[0]);
|
||||
ft_printf("%s\n", part[2]);
|
||||
if (flag)
|
||||
{
|
||||
ft_printf(" %s\n", part[1]);
|
||||
ft_printf(" %s\n", part[2]);
|
||||
ft_printf(" %s\n", part[0]);
|
||||
}
|
||||
result = result->next;
|
||||
free(part[0]);
|
||||
|
||||
Reference in New Issue
Block a user