gestion erreurs et leaks en cours de debug
This commit is contained in:
@@ -5,6 +5,8 @@
|
||||
# include <unistd.h> // read(), write(), sleep()
|
||||
# include <stdlib.h> // malloc(), free(), exit(), atoi()
|
||||
|
||||
# define INT_MAX 2147483647
|
||||
# define INT_MIN -2147483648
|
||||
|
||||
typedef struct s_stack
|
||||
{
|
||||
@@ -32,7 +34,7 @@ t_list *launch_algo(t_stack **a, t_stack **b, int i);
|
||||
void print_test(t_list *lst, char *s);
|
||||
void ps_usage(void);
|
||||
void ps_error(int i);
|
||||
void ps_stop(t_stack *stack, t_list *lst, int i);
|
||||
void ps_stop(t_list *lst, int i);
|
||||
|
||||
/*
|
||||
** algo.c // sort.c
|
||||
@@ -42,7 +44,7 @@ int find_pivot(t_stack *list, int size);
|
||||
int divide_a(t_stack **a, t_stack **b, t_list *solution);
|
||||
int divide_b(t_stack **a, t_stack **b, t_list *solution);
|
||||
void send_sublist_to_a(t_stack **a, t_stack **b, t_list *solution);
|
||||
void hugo_sort(t_stack **a, t_stack **b, t_list *lst);
|
||||
void hugo_sort(t_stack **a, t_stack **b, t_list *solution);
|
||||
|
||||
/*
|
||||
** sort_recursif.c
|
||||
@@ -95,28 +97,28 @@ void print_result(t_list *lst, int i);
|
||||
/*
|
||||
** swap
|
||||
*/
|
||||
t_list *sa(t_stack **a, t_list **lst);
|
||||
t_list *sb(t_stack **b, t_list **lst);
|
||||
t_list *ss(t_stack **a, t_stack **b, t_list **lst);
|
||||
t_list *sa(t_stack **a, t_list **solution);
|
||||
t_list *sb(t_stack **b, t_list **solution);
|
||||
t_list *ss(t_stack **a, t_stack **b, t_list **solution);
|
||||
|
||||
/*
|
||||
** push
|
||||
*/
|
||||
t_list *pa(t_stack **dst, t_stack **src, t_list **lst);
|
||||
t_list *pb(t_stack **dst, t_stack **src, t_list **lst);
|
||||
t_list *pa(t_stack **a, t_stack **b, t_list **solution);
|
||||
t_list *pb(t_stack **b, t_stack **a, t_list **solution);
|
||||
|
||||
/*
|
||||
** rotate
|
||||
*/
|
||||
t_list *ra(t_stack **stack, t_list **lst);
|
||||
t_list *rb(t_stack **stack, t_list **lst);
|
||||
t_list *rr(t_stack **a, t_stack **b, t_list **lst);
|
||||
t_list *ra(t_stack **a, t_list **solution);
|
||||
t_list *rb(t_stack **b, t_list **solution);
|
||||
t_list *rr(t_stack **a, t_stack **b, t_list **solution);
|
||||
|
||||
/*
|
||||
** reverse rotate
|
||||
*/
|
||||
t_list *rra(t_stack **stack, t_list **lst);
|
||||
t_list *rrb(t_stack **stack, t_list **lst);
|
||||
t_list *rrr(t_stack **a, t_stack **b, t_list **lst);
|
||||
t_list *rra(t_stack **a, t_list **solution);
|
||||
t_list *rrb(t_stack **b, t_list **solution);
|
||||
t_list *rrr(t_stack **a, t_stack **b, t_list **solution);
|
||||
|
||||
#endif
|
||||
|
||||
Reference in New Issue
Block a user