PUSH_SWAP/push_swap.h at main · UCYLMZ/PUSH_SWAP · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
/* ************************************************************************** */
/*                                                                            */
/*                                                        :::      ::::::::   */
/*   push_swap.h                                        :+:      :+:    :+:   */
/*                                                    +:+ +:+         +:+     */
/*   By: uyilmaz <uyilmaz@student.42.fr>            +#+  +:+       +#+        */
/*                                                +#+#+#+#+#+   +#+           */
/*   Created: 2023/02/27 10:03:13 by uyilmaz           #+#    #+#             */
/*   Updated: 2023/03/06 23:44:04 by uyilmaz          ###   ########.fr       */
/*                                                                            */
/* ************************************************************************** */

#ifndef PUSH_SWAP_H
# define PUSH_SWAP_H
# include <stdlib.h>
# include <unistd.h>

typedef struct s_list
{
	int				*content;
	struct s_list	*next;
}	t_list;

struct	s_data
{
	t_list	*stack_a;
	t_list	*stack_b;

	int		size_a;
	int		size_b;

	int		min_b;
	int		max_b;

	int		target;

	int		index_a;
	int		index_b;

	int		cost_a;
	int		cost_b;
	int		all_cost;
}	t_data;

char	*all_in_one(int count, char **values);
char	*ft_strjoin_v3(char *s1, char *s2);
int		ft_atoi(const char *str);
char	**ft_split(const char *s, char c);
int		char_check(char *data);
void	ft_putstr(char *str);
void	print_error(char *str);
int		**to_arr(char *str, int *size);
void	free_double_char(char **ptr);
int		check_doubles(int **arr, int size);
t_list	*list_initializer(int size, int **arr);
void	ft_lstclear(t_list **lst);
void	sort_init(t_list *list, int size);
int		is_list_sorted(t_list *list);
void	pb(t_list **stack_a, t_list **stack_b);
void	pa(t_list **stack_a, t_list **stack_b);
void	sa(t_list **stack_a);
void	sb(t_list **stack_b);
void	ss(t_list **stack_a, t_list **stack_b);
void	ra(t_list	**stack_a);
void	rb(t_list	**stack_b);
void	rr(t_list **stack_a, t_list **stack_b);
void	rra(t_list **stack_a);
void	rrb(t_list **stack_b);
void	rrr(t_list **stack_a, t_list **stack_b);
void	is_it_first(int a, t_list *stack_b);
void	low_size_handler(t_list *stack_a);
int		ft_abs(int a);
int		ft_abs_larger(int a, int b);
void	decider(int target);
void	prepare_stack_a(void);
void	prepare_stack_b(void);
void	get_biggest_top(int i);

#endif