mirror of
https://github.com/DavidGailleton/42-Push_Swap.git
synced 2026-01-27 00:41:57 +00:00
76 lines
2.5 KiB
C
76 lines
2.5 KiB
C
/* ************************************************************************** */
|
|
/* */
|
|
/* ::: :::::::: */
|
|
/* main.c :+: :+: :+: */
|
|
/* +:+ +:+ +:+ */
|
|
/* By: mteriier <mteriier@student.42lyon.fr> +#+ +:+ +#+ */
|
|
/* +#+#+#+#+#+ +#+ */
|
|
/* Created: 2025/12/08 18:32:35 by mteriier #+# #+# */
|
|
/* Updated: 2025/12/11 18:32:06 by dgaillet ### ########lyon.fr */
|
|
/* */
|
|
/* ************************************************************************** */
|
|
|
|
#include "push_swap.h"
|
|
#include <stdio.h>
|
|
#include <stdlib.h>
|
|
|
|
void print_all_stack(t_stack *stack, t_stack *first, char pile)
|
|
{
|
|
t_stack *tmp;
|
|
int i;
|
|
|
|
tmp = stack;
|
|
i = 0;
|
|
printf("TAB %c : \n", pile);
|
|
if (!stack || !first)
|
|
return ;
|
|
while (tmp->next != first)
|
|
{
|
|
printf("[%d] ", tmp->value);
|
|
tmp = tmp->next;
|
|
i++;
|
|
}
|
|
printf("[%d] \n", tmp->value);
|
|
}
|
|
|
|
int main(int argc, char **argv)
|
|
{
|
|
t_stacks *stacks;
|
|
|
|
stacks = NULL;
|
|
if (argc > 1)
|
|
{
|
|
stacks = init_big_stacks(argc, argv);
|
|
/* print_all_stack(stacks->a, stacks->a, 'A');
|
|
print_all_stack(stacks->b, stacks->b, 'B');
|
|
sa(stacks);
|
|
print_all_stack(stacks->a, stacks->a, 'A');
|
|
print_all_stack(stacks->b, stacks->b, 'B');
|
|
pb(stacks);
|
|
print_all_stack(stacks->a, stacks->a, 'A');
|
|
print_all_stack(stacks->b, stacks->b, 'B');
|
|
pa(stacks);
|
|
print_all_stack(stacks->a, stacks->a, 'A');
|
|
print_all_stack(stacks->b, stacks->b, 'B');
|
|
rra(stacks);
|
|
print_all_stack(stacks->a, stacks->a, 'A');
|
|
print_all_stack(stacks->b, stacks->b, 'B');
|
|
pb(stacks);
|
|
pb(stacks);
|
|
print_all_stack(stacks->a, stacks->a, 'A');
|
|
print_all_stack(stacks->b, stacks->b, 'B');
|
|
rrb(stacks);
|
|
print_all_stack(stacks->a, stacks->a, 'A');
|
|
print_all_stack(stacks->b, stacks->b, 'B');
|
|
rrr(stacks);
|
|
print_all_stack(stacks->a, stacks->a, 'A');
|
|
print_all_stack(stacks->b, stacks->b, 'B');
|
|
*/
|
|
print_stacks(stacks, highest_stack_len(stacks), stacks->a, stacks->b);
|
|
insertion(stacks, stack_a_len(stacks), 0);
|
|
print_stacks(stacks, highest_stack_len(stacks), stacks->a, stacks->b);
|
|
}
|
|
stack_clear_all(stacks->a, stacks->a);
|
|
stack_clear_all(stacks->b, stacks->b);
|
|
}
|