da7e/42-Push_Swap
1
0
Fork 0
mirror of https://github.com/DavidGailleton/42-Push_Swap.git synced 2026-01-27 00:41:57 +00:00
Code Issues Packages Projects Releases Wiki Activity

adding makefile and debugging to try new test for the preset to test the program

Browse Source
This commit is contained in:
Maoake
2025-12-10 21:02:33 +00:00
parent b6c1dc73a8
commit 5372b944a4
11 changed files with 78 additions and 24 deletions
Download Patch File Download Diff File Expand all files Collapse all files

13
push_swap.h
View File

@@ -28,7 +28,7 @@ typedef struct s_stacks
typedef struct s_tab
{
int range_max;
int max_range;
int nb_in;
struct s_tab *next;
} t_tab;
@@ -53,17 +53,20 @@ 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 get_number_in_range(int range, t_stacks *piles);
int get_number_in_range(int range, t_stack *a);
int in_range(int value, int max_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 is_upper_compare(t_stack t1, t_stack t2);
t_tab *free_tab(t_tab *first);
t_tab *get_next_tab(t_stack *first, t_tab tab);
t_tab *first_tab(t_stack *first);
t_tab *get_next_tab(t_stack *first, t_tab *tab);
t_tab *init_first_tab(t_stack *first);
t_tab *allocate_tab(int range_max, int nb);
#endif