/*
sort_stack Copyright (C) 2026 yctct

This program is free software: you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation, either version 3 of the License, or
(at your option) any later version.

This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
GNU General Public License for more details.

You should have received a copy of the GNU General Public License
along with this program.  If not, see <https://www.gnu.org/licenses/>.
*/


#include "../include/push_swap.h"

void	rotate(t_list **stack)
{
	t_list	*a;
	t_list	*b;
	t_list	*current;

	a = *stack;
	b = a->next;
	current = *stack;
	while (current->next != NULL)
		current = current->next;
	current->next = a;
	a->next = NULL;
	*stack = b;
	reset_index(*stack);
}

void	ra(t_list **stack)
{
	rotate(stack);
	write(1, "ra", 2);
	write(1, "\n", 1);
}

void	rb(t_list **stack)
{
	rotate(stack);
	write(1, "rb", 2);
	write(1, "\n", 1);
}

void	rr(t_list **stack_a, t_list **stack_b)
{
	rotate(stack_a);
	rotate(stack_b);
	write(1, "rr", 2);
	write(1, "\n", 1);
}