mirror of
https://github.com/DavidGailleton/42-Push_Swap.git
synced 2026-01-27 08:41:58 +00:00
90 lines
2.2 KiB
C
90 lines
2.2 KiB
C
/* ************************************************************************** */
|
|
/* */
|
|
/* ::: :::::::: */
|
|
/* utils_struct_tab.c :+: :+: :+: */
|
|
/* +:+ +:+ +:+ */
|
|
/* By: mteriier <mteriier@student.42lyon.fr> +#+ +:+ +#+ */
|
|
/* +#+#+#+#+#+ +#+ */
|
|
/* Created: 2025/12/10 13:36:43 by mteriier #+# #+# */
|
|
/* Updated: 2025/12/10 13:36:48 by mteriier ### ########lyon.fr */
|
|
/* */
|
|
/* ************************************************************************** */
|
|
|
|
#include "push_swap.h"
|
|
#include <stdlib.h>
|
|
|
|
t_tab *allocate_tab(int range_max, int nb)
|
|
{
|
|
t_tab *tab;
|
|
|
|
tab = malloc(sizeof(t_tab));
|
|
if (!tab)
|
|
return (NULL);
|
|
tab->max_range = range_max;
|
|
tab->nb_in = nb;
|
|
return (tab);
|
|
}
|
|
|
|
t_tab *get_tabs(t_stack *first)
|
|
{
|
|
t_tab *tmp;
|
|
t_tab *first_tab;
|
|
int len_stack;
|
|
int scan_nb_in_tab;
|
|
|
|
len_stack = stack_len(first);
|
|
first_tab = init_first_tab(first);
|
|
if (!first_tab)
|
|
return (NULL);
|
|
scan_nb_in_tab = first_tab->nb_in;
|
|
tmp = first_tab;
|
|
while (scan_nb_in_tab < len_stack)
|
|
{
|
|
tmp->next = get_next_tab(first, tmp);
|
|
if (!(tmp->next))
|
|
return (free_tab(first_tab));
|
|
tmp = tmp->next;
|
|
scan_nb_in_tab += tmp->nb_in;
|
|
}
|
|
return (first_tab);
|
|
}
|
|
|
|
t_tab *init_first_tab(t_stack *first)
|
|
{
|
|
t_tab *tab;
|
|
int lower;
|
|
int range_max;
|
|
|
|
lower = get_first_lower(first);
|
|
range_max = calcul_range(lower, 10);
|
|
tab = allocate_tab(range_max, get_number_in_range(range_max, first));
|
|
if (!tab)
|
|
return (NULL);
|
|
return (tab);
|
|
}
|
|
|
|
t_tab *get_next_tab(t_stack *first, t_tab *tab)
|
|
{
|
|
int lower;
|
|
int range_max;
|
|
t_tab *next_tab;
|
|
|
|
lower = get_next_lower(first, tab->max_range);
|
|
range_max = calcul_range(lower, 10);
|
|
next_tab = allocate_tab(range_max, get_number_in_range(range_max, first));
|
|
return (next_tab);
|
|
}
|
|
|
|
t_tab *free_tab(t_tab *first)
|
|
{
|
|
t_tab *tmp;
|
|
|
|
while (first)
|
|
{
|
|
tmp = first->next;
|
|
free(first);
|
|
first = tmp;
|
|
}
|
|
return (NULL);
|
|
}
|