/* 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 . */ #include "../include/push_swap.h" void rrotate(t_list **stack) { t_list *a; // t_list *b; t_list *current; t_list *prev; a = *stack; // b = a->next; current = *stack; prev = NULL; while (current->next != NULL) { prev = current; current = current->next; } current->next = a; prev->next = NULL; *stack = current; reset_index(*stack); } void rra(t_list **stack) { rrotate(stack); write(1, "rra", 3); write(1, "\n", 1); } void rrb(t_list **stack) { rrotate(stack); write(1, "rrb", 3); write(1, "\n", 1); } void rrr(t_list **stack_a, t_list **stack_b) { rrotate(stack_a); rrotate(stack_b); write(1, "rrr", 3); write(1, "\n", 1); }