push_swap.h

/* ************************************************************************** */
/*                                                                            */
/*                                                        :::      ::::::::   */
/*   push_swap.h                                        :+:      :+:    :+:   */
/*                                                    +:+ +:+         +:+     */
/*   By: lpalacio <lpalacio@student.42madrid>       +#+  +:+       +#+        */
/*                                                +#+#+#+#+#+   +#+           */
/*   Created: 2023/11/12 21:34:32 by lpalacio          #+#    #+#             */
/*   Updated: 2024/03/22 20:37:56 by lpalacio         ###   ########.fr       */
/*                                                                            */
/* ************************************************************************** */

#ifndef PUSH_SWAP_H
# define PUSH_SWAP_H
# include "libft/libft.h"

enum	e_stack_content
{
	value = 0,
	position = 1
};

enum	e_stack_position
{
	unset = -1
};

/** push_swap_utils.c **/
void	error_and_exit(int n);
int		count_rows(char **args);
int		is_sorted(t_list *lst);
void	rotate_a_ntimes(int times, t_list **stack_a);
void	reverse_a_ntimes(int times, t_list **stack_a);

/** moves_push_swap.c **/
int		swap(t_list **stack, char *str);
int		push(t_list **lst_src, t_list **lst_dst, char *str);
int		rotate(t_list **stack, char *str);
int		reverse(t_list **stack, char *str);
void	push_all_a(t_list **lst_src, t_list **lst_dst);

/** data_precheck_and_load.c **/
void	check_duplicated_and_sort(t_list *stack);
int		check_and_load(char *argv[], t_list **stack_a);
int		is_valid_str_for_int(char *str);

/** radix_sort.c **/
void	radix_sort(t_list **stack_a, int stack_size);

#endif