-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathpush_swap.h
More file actions
119 lines (109 loc) · 3.76 KB
/
Copy pathpush_swap.h
File metadata and controls
119 lines (109 loc) · 3.76 KB
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
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
/* ************************************************************************** */
/* */
/* ::: :::::::: */
/* push_swap.h :+: :+: :+: */
/* +:+ +:+ +:+ */
/* By: juhenriq <dev@juliohenrique.com> +#+ +:+ +#+ */
/* +#+#+#+#+#+ +#+ */
/* Created: 2025/03/15 02:44:54 by juhenriq #+# #+# */
/* Updated: 2025/04/02 02:07:23 by juhenriq ### ########.fr */
/* */
/* ************************************************************************** */
#ifndef PUSH_SWAP_H
# define PUSH_SWAP_H
# include "./libft/libft.h"
typedef enum e_target_stack
{
NO_TARGET_STACK_DEFINED,
TARGET_STACK_A,
TARGET_STACK_B
} t_target_stack;
typedef enum e_movements
{
PA,
PB,
SA,
SB,
SS,
RA,
RB,
RR,
RRA,
RRB,
RRR
} t_movements;
typedef struct s_stack_element
{
int value;
int is_used;
t_target_stack target_stack;
int target_elem_idx;
int elem_cost;
} t_stack_element;
typedef struct s_stack
{
t_stack_element *array;
int highest_idx_used;
} t_stack;
typedef struct s_movement_stack
{
int movement_stack_total_len;
int movement_stack_used_len;
t_movements *movement_array;
} t_stacks_movements;
typedef struct s_stacks
{
t_stack stack_a;
t_stack stack_b;
int stack_len;
t_stacks_movements stacks_movements;
int visualization_mode;
} t_stacks;
void pa(t_stacks *stacks);
void pb(t_stacks *stacks);
void sa(t_stacks *stacks);
void sb(t_stacks *stacks);
void ss(t_stacks *stacks);
void ra(t_stacks *stacks);
void rb(t_stacks *stacks);
void rr(t_stacks *stacks);
void rra(t_stacks *stacks);
void rrb(t_stacks *stacks);
void rrr(t_stacks *stacks);
void print_stacks(t_stacks *stacks);
char *_pick_movement_str(t_movements movement);
void free_stacks_arrays(t_stacks *tstacks);
void we_had_an_error(void);
void we_had_an_error_with_free(t_stacks *stacks);
int sort_two_elem(t_stacks *stacks);
void sort_the_three_elements_on_stack_a(t_stacks *stacks);
void move_two_elements_to_b(t_stacks *stacks);
int get_idx_of_higher_nb_smallest_difference(int value, t_stack *to_stack);
int get_idx_of_smallest_nb(t_stack *to_stack);
int get_idx_of_smaller_nb_smallest_difference(int value, t_stack *to_stack);
int get_idx_of_highest_nb(t_stack *to_stack);
int is_b_empty(t_stack *stack_b);
void set_target_for_every_element(t_target_stack target_mode,
t_stacks *stacks);
void define_movement_costs(t_target_stack target_mode,
t_stacks *stacks);
void _decide_how_mv_top(int *upwards, int highest_idx_used,
int *move_cost, int elem_idx);
void turks_initial_movements(t_stacks *stacks);
void move_elem_to_top(int elem_idx, t_stack *stack, t_stacks *stacks);
void move_most_fit_elem_and_its_target_to_top(t_target_stack target_mode,
t_stacks *stacks);
void move_min_nb_to_top(t_stacks *stacks);
void turks_algorithm(t_stacks *stacks);
void five_elem_strategy(t_stacks *stacks);
void print_used_movements(t_stacks_movements *stacks_movements);
void print_stacks(t_stacks *stacks);
void add_movement(t_movements movement_identifier, t_stacks *stacks);
void check_input_and_fill_stacks(int argc, char **argv, t_stacks *stacks);
int check_nb_uniqueness(int nb, t_stack *stack);
void initialize_stacks(int argc, t_stacks *stacks);
int is_stack_sorted(t_stacks *stacks);
void set_stacks_pointers_on_mode(t_target_stack target_mode,
t_stacks *stacks, t_stack **from_stack, t_stack **to_stack);
void stack_set_value(int idx, int value, t_stack *stack);
#endif