/* By: ljiriste <marvin@42.fr> +#+ +:+ +#+ */
/* +#+#+#+#+#+ +#+ */
/* Created: 2024/01/24 12:13:51 by ljiriste #+# #+# */
-/* Updated: 2024/02/24 14:06:52 by ljiriste ### ########.fr */
+/* Updated: 2024/02/29 10:27:01 by ljiriste ### ########.fr */
/* */
/* ************************************************************************** */
t_target target;
} t_command;
-void init_stack(t_stack *s);
-void clean_up(t_stacks *s);
+void init_stack(t_stack *s);
+void clean_up(t_stacks *s);
/*
t_action action_push;
t_action action_swap;
t_action action_reverse_rotate;
*/
-void action_push(t_stacks *s, t_target target);
-void action_swap(t_stacks *s, t_target target);
-void action_rotate(t_stacks *s, t_target target);
-void action_reverse_rotate(t_stacks *s, t_target target);
+void action_push(t_stacks *s, t_target target);
+void action_swap(t_stacks *s, t_target target);
+void action_rotate(t_stacks *s, t_target target);
+void action_reverse_rotate(t_stacks *s, t_target target);
-void print_push(t_stacks *s, t_target target);
-void print_swap(t_stacks *s, t_target target);
-void print_rotate(t_stacks *s, t_target target);
-void print_reverse_rotate(t_stacks *s, t_target target);
+void print_push(t_stacks *s, t_target target);
+void print_swap(t_stacks *s, t_target target);
+void print_rotate(t_stacks *s, t_target target);
+void print_reverse_rotate(t_stacks *s, t_target target);
-void stack_push(t_stack *s, int el);
-void stack_swap(t_stack *s);
-void stack_rotate(t_stack *s, int amount);
-void stack_pop(t_stack *s);
-int stack_top(t_stack *s);
+t_arr_stat stack_push(t_stack *s, int el);
+void stack_swap(t_stack *s);
+void stack_rotate(t_stack *s, int amount);
+void stack_pop(t_stack *s);
+int stack_top(t_stack *s);
-int is_sorted(t_stack *s);
-int parse(int argc, char **argv, t_stack *s);
-void prepare_stacks(t_stacks *s, size_t ind_a, size_t ind_b);
-size_t cost(t_stacks *s, const size_t b_plus, const size_t a_plus);
-size_t find_best(t_stacks *s, t_vec *target_a_indeces);
-size_t find_target_ind(t_stack *stack, int val);
-size_t find_minind(t_stack *s);
+int is_sorted(t_stack *s);
+int parse(int argc, char **argv, t_stack *s);
+void prepare_stacks(t_stacks *s, size_t ind_a, size_t ind_b);
+size_t cost(t_stacks *s, const size_t b_plus, const size_t a_plus);
+size_t find_best(t_stacks *s, t_vec *target_a_indeces);
+size_t find_target_ind(t_stack *stack, int val);
+size_t find_minind(t_stack *s);
#endif //CHECKER_H
/* By: ljiriste <marvin@42.fr> +#+ +:+ +#+ */
/* +#+#+#+#+#+ +#+ */
/* Created: 2024/01/24 11:48:47 by ljiriste #+# #+# */
-/* Updated: 2024/01/24 13:59:25 by ljiriste ### ########.fr */
+/* Updated: 2024/02/29 10:25:56 by ljiriste ### ########.fr */
/* */
/* ************************************************************************** */
return ;
}
-void stack_push(t_stack *s, int el)
+t_arr_stat stack_push(t_stack *s, int el)
{
- ft_vec_insert(&s->stack, &el, s->ind);
- return ;
+ return (ft_vec_insert(&s->stack, &el, s->ind));
}
void stack_swap(t_stack *s)