/* ************************************************************************** */
/*                                                                            */
/*                                                        :::      ::::::::   */
/*   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"

t_tab	*allocate_tab(int range_max, int nb)
{
	t_tab	tab;

	tab = malloc(sizeof(t_tab));
	if (!tab)
		return (NULL);
	tab->range_max = range_max;
	tab->nb_in = nb;
	return (tab);
}

void	link_tab(t_tab *previous, t_tab *new)
{
	previous->next = new;
}

t_tab	*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);
}