mirror of
https://github.com/DavidGailleton/42-Push_Swap.git
synced 2026-01-27 00:41:57 +00:00
finish to link all the files
This commit is contained in:
Maoake Teriierooiterai
@@ -24,10 +24,18 @@ typedef struct s_tab
|
||||
int wich_path(t_stacks *piles, int max_range, int range, char c);
|
||||
int stack_len(t_stack *stack);
|
||||
void bucket_algo(t_stacks *piles, t_tab *preset, int range);
|
||||
/* SORT UTILS 2 FILE */
|
||||
/* SORT UTILS FILES */
|
||||
void sort_from_left(t_stacks *piles);
|
||||
void sort_from_right(t_stacks *piles);
|
||||
/* SORT UTILS FILE */
|
||||
|
||||
void push_range_to_b(t_stacks *piles, t_tab *one_preset, int range);
|
||||
/* MEDIUM UTILS FILES */
|
||||
int range_bucket(t_stack *first);
|
||||
int get_first_lower(t_stack *first);
|
||||
int get_next_lower(t_stack *first, int old_lower);
|
||||
int calcul_range(int value, int range);
|
||||
int in_range(int value, int max_range, int range);
|
||||
int get_number_in_range(int max_range, t_stack *a, int range);
|
||||
/* UTILS STRUCT TAB FILE */
|
||||
t_tab *get_tabs(t_stack *first, int range);
|
||||
|
||||
#endif
|
||||
|
||||
@@ -10,4 +10,11 @@
|
||||
/* */
|
||||
/* ************************************************************************** */
|
||||
|
||||
#ifndef PARSING_H
|
||||
# define PARSING_H
|
||||
|
||||
int ft_atoi(const char *nptr);
|
||||
t_stacks *init_big_stacks2(int *tab, int len);
|
||||
t_stacks *init_big_stacks(int argc, char **argv);
|
||||
|
||||
#endif
|
||||
|
||||
@@ -26,92 +26,43 @@ typedef struct s_stacks
|
||||
t_stack *b;
|
||||
} t_stacks;
|
||||
|
||||
typedef struct s_tab
|
||||
{
|
||||
int max_range;
|
||||
int nb_in;
|
||||
struct s_tab *next;
|
||||
} t_tab;
|
||||
|
||||
/* PRINT STACK FUNCTION*/
|
||||
void print_stacks(t_stacks *stacks, int len, t_stack *a, t_stack *b);
|
||||
/*STACK_FUNCTIONS*/
|
||||
void pa(t_stacks *stacks);
|
||||
void pb(t_stacks *stacks);
|
||||
void rra(t_stacks *stacks);
|
||||
void rrb(t_stacks *stacks);
|
||||
void rrr(t_stacks *stacks);
|
||||
void ra(t_stacks *stacks);
|
||||
void rb(t_stacks *stacks);
|
||||
void rr(t_stacks *stacks);
|
||||
void sa(t_stacks *stacks);
|
||||
void sb(t_stacks *stacks);
|
||||
void ss(t_stacks *stacks);
|
||||
|
||||
/*FUNCTION UTILS*/
|
||||
t_stack *new_stack(int value);
|
||||
void stack_add_back(t_stack **stack, t_stack *new);
|
||||
void stack_add_front(t_stack **stack, t_stack *new);
|
||||
void stack_clear_all(t_stack *stack, t_stack *first);
|
||||
t_stack *parsing(int argc, char **argv);
|
||||
t_stacks *init_big_stacks(int argc, char **argv);
|
||||
int ft_atoi(const char *nptr);
|
||||
/*FUNCTION UTILS ALGO*/
|
||||
int check_order(t_stack *stack);
|
||||
int is_upper_compare(t_stack *t1, t_stack *t2);
|
||||
int stack_len(t_stack *stack);
|
||||
/*FUNCTION FOR MEDIUM ALGO*/
|
||||
t_tab *get_tabs(t_stack *first, int range);
|
||||
int get_number_in_range(int max_range, t_stack *a, int range);
|
||||
int in_range(int value, int max_range, int range);
|
||||
int calcul_range(int value, int range);
|
||||
int get_next_lower(t_stack *first, int old_lower);
|
||||
int get_first_lower(t_stack *first);
|
||||
int my_sqrt(int nb);
|
||||
int get_max_number(t_stack *first);
|
||||
int get_min_number(t_stack *first);
|
||||
int range_bucket(t_stack *first);
|
||||
t_tab *free_tab(t_tab **first);
|
||||
t_tab *get_next_tab(t_stack *first, t_tab *tab, int range);
|
||||
t_tab *init_first_tab(t_stack *first, int range);
|
||||
t_tab *allocate_tab(int range_max, int nb);
|
||||
int wich_path(t_stacks *piles, int max_range, int range, char c);
|
||||
int path_to_start(t_stacks *piles, int max_range, int range, char c);
|
||||
int path_to_end(t_stacks *piles, int max_range, int range, char c);
|
||||
void bucket_algo(t_stacks *piles, t_tab *preset, int range);
|
||||
void push_range_to_b(t_stacks *piles, t_tab *one_preset, int range);
|
||||
int sort_path(t_stacks *piles, int value);
|
||||
int number_move_reverse(t_stacks *piles, int value, char start_end);
|
||||
void sort_little_pile(t_stacks *piles);
|
||||
void sort_from_left(t_stacks *piles);
|
||||
void sort_from_right(t_stacks *piles);
|
||||
/*FUNCTION IN MAIN*/
|
||||
void print_all_stack(t_stack *stack, t_stack *first, char pile);
|
||||
int verif_no_double(int *tab, int len, int value);
|
||||
int adding_number(int *tab, int len);
|
||||
int *auto_shuffle(int len_tab);
|
||||
/*FUNCTION IN FILE TEST*/
|
||||
int test1(int argc, char **argv);
|
||||
int test2(char **argv);
|
||||
/*FUNCTION IN PARSIN 2*/
|
||||
t_stack *parsing2(int *tab, int len);
|
||||
t_stacks *init_big_stacks2(int *tab, int len);
|
||||
void print_tabs(t_tab *preset);
|
||||
void print_stacks(t_stacks *stacks, int len, t_stack *a, t_stack *b);
|
||||
int stack_a_len(t_stacks *stacks);
|
||||
int stack_b_len(t_stacks *stacks);
|
||||
int highest_stack_len(t_stacks *stacks);
|
||||
|
||||
/*ALGORITHM UTILS*/
|
||||
int check_order(t_stack *stack);
|
||||
void iterate_fn(t_stacks *stacks, int i, void (f)(t_stacks *stacks));
|
||||
int is_lowest(t_stack *stack, t_stack *node, int len);
|
||||
int is_highest(t_stack *stack, t_stack *node, int len);
|
||||
void optimal_rotate(t_stacks *stacks, int i, int len, char stack);
|
||||
int r_to_lowest(t_stack *stack, int len);
|
||||
void sort_three_a(t_stacks *stacks);
|
||||
|
||||
/*ALGORITHMS*/
|
||||
void bubble_alg(t_stacks *stacks);
|
||||
//void insertion(t_stacks *stacks, int a_len, int b_len);
|
||||
void insertion(t_stacks *stacks, int len);
|
||||
void pa(t_stacks *stacks);
|
||||
void pb(t_stacks *stacks);
|
||||
void rra(t_stacks *stacks);
|
||||
void rrb(t_stacks *stacks);
|
||||
void rrr(t_stacks *stacks);
|
||||
void ra(t_stacks *stacks);
|
||||
void rb(t_stacks *stacks);
|
||||
void rr(t_stacks *stacks);
|
||||
void sa(t_stacks *stacks);
|
||||
void sb(t_stacks *stacks);
|
||||
void ss(t_stacks *stacks);
|
||||
/* STACK ADD AND CLEAR FILES */
|
||||
t_stack *new_stack(int value);
|
||||
void stack_add_back(t_stack **stack, t_stack *new);
|
||||
void stack_add_front(t_stack **stack, t_stack *new);
|
||||
void stack_clear_all(t_stack *stack, t_stack *first);
|
||||
/* STACKS LEN FILES */
|
||||
int stack_a_len(t_stacks *stacks);
|
||||
int stack_b_len(t_stacks *stacks);
|
||||
int highest_stack_len(t_stacks *stacks);
|
||||
/* PRE SORT */
|
||||
int r_to_lowest(t_stack *stack, int len);
|
||||
void sort_three_a(t_stacks *stacks);
|
||||
/* ITERATE FILE */
|
||||
void optimal_rotate(t_stacks *stacks, int i, int len, char stack);
|
||||
/* COMPARE FILE */
|
||||
int is_lowest(t_stack *stack, t_stack *node, int len);
|
||||
int is_highest(t_stack *stack, t_stack *node, int len);
|
||||
/* CHECK ORDER FILE */
|
||||
int check_order(t_stack *stack);
|
||||
/* INSERTION */
|
||||
void insertion(t_stacks *stacks, int len);
|
||||
int test2(char **argv);
|
||||
/* TEST FILE */
|
||||
int test1(int argc, char **argv);
|
||||
|
||||
#endif
|
||||
|
||||
@@ -1,13 +0,0 @@
|
||||
/* ************************************************************************** */
|
||||
/* */
|
||||
/* ::: :::::::: */
|
||||
/* simple_headers.h :+: :+: :+: */
|
||||
/* +:+ +:+ +:+ */
|
||||
/* By: mteriier <mteriier@student.42lyon.fr> +#+ +:+ +#+ */
|
||||
/* +#+#+#+#+#+ +#+ */
|
||||
/* Created: 2026/01/07 07:47:59 by mteriier #+# #+# */
|
||||
/* Updated: 2026/01/07 07:48:02 by mteriier ### ########lyon.fr */
|
||||
/* */
|
||||
/* ************************************************************************** */
|
||||
|
||||
|
||||
Reference in New Issue
Block a user