ft_push_swap.h

/* ************************************************************************** */
/*                                                                            */
/*                                                        :::      ::::::::   */
/*   ft_push_swap.h                                     :+:      :+:    :+:   */
/*                                                    +:+ +:+         +:+     */
/*   By: mleitner <mleitner@student.42vienna.com    +#+  +:+       +#+        */
/*                                                +#+#+#+#+#+   +#+           */
/*   Created: 2023/01/17 15:03:19 by mleitner          #+#    #+#             */
/*   Updated: 2023/02/28 13:35:51 by mleitner         ###   ########.fr       */
/*                                                                            */
/* ************************************************************************** */

#ifndef FT_PUSH_SWAP_H
# define FT_PUSH_SWAP_H

# include <stdio.h>
# include <unistd.h>
# include <stdlib.h>

typedef struct s_value {
	int				value;
	int				pos_sor;
	int				pos_uns;
	struct s_value	*next;
}	t_value;

typedef struct s_set {
	int	*a;
	int	*b;
	int	*moves;
	int	len_a;
	int	len_b;
	int	i;
}	t_set;

//error check
void	ill_chr(char **str, int n);
void	empty_args(char **str, int n);
void	is_sorted(char **split, int n);
void	is_duplicate(char **split, int n);
void	range_chk(char **split, int n);
int		*arg_check(int n, char **argv, int argc);

//list functions
t_value	*ft_lstnew(t_value *prev, int value, int sort);
t_value	*ft_lstlast(t_value *lst);
void	list_ass(t_value *src, t_value *dst);
void	free_list(t_value *head, void *ptr1, void *ptr2, void *ptr3);

//quicksort
void	swap_nodes(t_value	*src, t_value *dst);
t_value	*partition(t_value *first, t_value *last);
void	quicksort_list(t_value *first, t_value *last);
void	relabel(t_value *lst);

//radix sort
t_set	*set_settings(int *a, int *b, int len_a, int len_b);
void	perform_moves(t_set	*set, int step);
int		lists_sorted(t_set *set);
int		*calc_moves(int *order, int values);
void	sort_stack(t_set *set, int pos);

//helper
int		to_power(int nb, int power);
int		*sort_array(t_value *arr, int values);
void	print_instr(int *moves);
void	*ft_calloc(size_t nmemb, size_t size);
void	ft_bzero(void *s, size_t n);

//helper2
long	ft_atoi(const char *nptr);
int		ft_isdigit(char c);
int		ft_isspace(int c);

//argument parsing
int		ft_cntwrds(char **s, char c);
char	*ft_strcpy(char *s, char c);
char	**ft_split(char **s, char c);

//small sorting (up to 3)
void	small_sort(int *val);

//medium sorting (up to 5)
int		find_max(int *val, int num);
int		find_min(int *val, int num);
int		arr_sorted(int *arr, int num);
void	medium_sort_helper(int *a, int *b, int len_a, int len_b);
void	medium_sort(int *val, int num);

//instructions for sorting
void	r_rotate(int *values, int len, int print);
void	swap(int *a, int *b, int print);
void	push(int *src, int *dst, int len_src, int len_dst);
void	rotate(int *values, int len, int print);

#endif