104 lines
1.8 KiB
C
104 lines
1.8 KiB
C
#include "push_swap.h"
|
|
|
|
int check_flag(int *ac, char ***av)
|
|
{
|
|
if (ft_strcmp((*av)[1], "-p") == 0)
|
|
{
|
|
(*av)++;
|
|
(*ac)--;
|
|
return (1);
|
|
}
|
|
if (ft_strcmp((*av)[1], "-P") == 0)
|
|
{
|
|
(*av)++;
|
|
(*ac)--;
|
|
return (2);
|
|
}
|
|
return (0);
|
|
}
|
|
|
|
t_stack *fill_stack(t_stack *list, char *nb)
|
|
{
|
|
t_stack *new;
|
|
long nbl;
|
|
|
|
new = ft_calloc(1, sizeof(t_stack));
|
|
if (!new)
|
|
ps_stop((t_list *)list, 3);
|
|
new->next = list;
|
|
list = new;
|
|
if (ft_isnumber(nb) == 0)
|
|
ps_stop((t_list *)list, 3);
|
|
nbl = ft_atol(nb);
|
|
if (nbl < INT_MIN || nbl > INT_MAX)
|
|
ps_stop((t_list *)list, 3);
|
|
list->n = nbl;
|
|
list->limit = 0;
|
|
return (list);
|
|
}
|
|
|
|
t_stack *init_stack(int ac, char **av)
|
|
{
|
|
char **split;
|
|
t_stack *list;
|
|
int i;
|
|
|
|
list = NULL;
|
|
if (ac > 2)
|
|
while (--ac)
|
|
list = fill_stack(list, av[ac]);
|
|
else if (ac == 2)
|
|
{
|
|
split = ft_split(av[1], ' ');
|
|
i = 0;
|
|
while (split[i] != NULL)
|
|
i++;
|
|
while (--i >= 0)
|
|
list = fill_stack(list, split[i]);
|
|
}
|
|
return (list);
|
|
}
|
|
|
|
/*
|
|
** the chained list "solution" is created with specials first two elements :
|
|
** they are pointers to stack a and b, so it can be accessed by fill_solution()
|
|
*/
|
|
t_list *launch_algo(t_stack **a, t_stack **b, int flag)
|
|
{
|
|
t_list *solution;
|
|
|
|
solution = ft_lstnew(a);
|
|
ft_lstadd_back(&solution, ft_lstnew(b));
|
|
if (flag)
|
|
{
|
|
fill_solution(solution, "start");
|
|
mark_step(solution, "start");
|
|
}
|
|
if (sublist_size(*a) <= 3)
|
|
special_sort_3(a, solution);
|
|
else if (sublist_size(*a) <= 5)
|
|
special_sort_5(a, b, solution);
|
|
else
|
|
hugo_sort(a, b, solution);
|
|
// bubble_sort_luke(a, b, solution);
|
|
return (solution);
|
|
}
|
|
|
|
int main(int ac, char **av)
|
|
{
|
|
t_stack *a;
|
|
t_stack *b;
|
|
t_list *solution;
|
|
int flag;
|
|
|
|
if (ac < 2)
|
|
ps_stop(NULL, 1);
|
|
flag = check_flag(&ac, &av);
|
|
a = init_stack(ac, av);
|
|
b = NULL;
|
|
solution = launch_algo(&a, &b, flag);
|
|
print_result(solution, flag);
|
|
ps_stop(solution, 0);
|
|
return (0);
|
|
}
|