-
Notifications
You must be signed in to change notification settings - Fork 0
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
* fix Makefile * add test is_sorted_stack * update error case spec * update checker_spec * update Makefile * fix leak * fix flags * add test
- Loading branch information
Showing
10 changed files
with
191 additions
and
109 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
|
|
@@ -6,7 +6,7 @@ | |
| /* By: reasuke <[email protected]> +#+ +:+ +#+ */ | ||
| /* +#+#+#+#+#+ +#+ */ | ||
| /* Created: 2024/02/14 10:26:54 by reasuke #+# #+# */ | ||
| /* Updated: 2024/02/14 10:29:44 by reasuke ### ########.fr */ | ||
| /* Updated: 2024/02/19 12:11:08 by reasuke ### ########.fr */ | ||
| /* */ | ||
| /* ************************************************************************** */ | ||
|
|
||
|
|
@@ -16,4 +16,6 @@ | |
| # include "../libft/libft.h" | ||
| # include "types.h" | ||
|
|
||
| void sort_based_on_operation(t_stack **p_a, t_stack **p_b); | ||
|
|
||
| #endif | ||
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
|
|
@@ -6,73 +6,34 @@ | |
| /* By: reasuke <[email protected]> +#+ +:+ +#+ */ | ||
| /* +#+#+#+#+#+ +#+ */ | ||
| /* Created: 2024/02/14 10:25:27 by reasuke #+# #+# */ | ||
| /* Updated: 2024/02/14 13:50:38 by reasuke ### ########.fr */ | ||
| /* Updated: 2024/02/19 12:49:49 by reasuke ### ########.fr */ | ||
| /* */ | ||
| /* ************************************************************************** */ | ||
|
|
||
| #include "checker.h" | ||
| #include "initialization.h" | ||
| #include "sort.h" | ||
| #include "stack_operations.h" | ||
|
|
||
| static bool _is_operation_present(const char *op) | ||
| { | ||
| bool present; | ||
| #ifdef LEAK | ||
| # ifdef __APPLE__ | ||
|
|
||
| present = false; | ||
| present |= !ft_strcmp(op, "sa\n"); | ||
| present |= !ft_strcmp(op, "sb\n"); | ||
| present |= !ft_strcmp(op, "ss\n"); | ||
| present |= !ft_strcmp(op, "pa\n"); | ||
| present |= !ft_strcmp(op, "pb\n"); | ||
| present |= !ft_strcmp(op, "ra\n"); | ||
| present |= !ft_strcmp(op, "rb\n"); | ||
| present |= !ft_strcmp(op, "rr\n"); | ||
| present |= !ft_strcmp(op, "rra\n"); | ||
| present |= !ft_strcmp(op, "rrb\n"); | ||
| present |= !ft_strcmp(op, "rrr\n"); | ||
| return (present); | ||
| } | ||
| void leak_check(void) __attribute__((destructor)); | ||
|
|
||
| static void _stack_operation(t_stack **p_a, t_stack **p_b, const char *op) | ||
| void leak_check(void) | ||
| { | ||
| if (!ft_strcmp(op, "sa\n") || !ft_strcmp(op, "ss\n")) | ||
| swap_stack(p_a); | ||
| if (!ft_strcmp(op, "sb\n") || !ft_strcmp(op, "ss\n")) | ||
| swap_stack(p_b); | ||
| if (!ft_strcmp(op, "pa\n")) | ||
| push_stack(p_b, p_a); | ||
| if (!ft_strcmp(op, "pb\n")) | ||
| push_stack(p_a, p_b); | ||
| if (!ft_strcmp(op, "ra\n") || !ft_strcmp(op, "rr\n")) | ||
| rotate_stack(p_a); | ||
| if (!ft_strcmp(op, "rb\n") || !ft_strcmp(op, "rr\n")) | ||
| rotate_stack(p_b); | ||
| if (!ft_strcmp(op, "rra\n") || !ft_strcmp(op, "rrr\n")) | ||
| reverse_rotate_stack(p_a); | ||
| if (!ft_strcmp(op, "rrb\n") || !ft_strcmp(op, "rrr\n")) | ||
| reverse_rotate_stack(p_b); | ||
| system("leaks -q checker"); | ||
| } | ||
|
|
||
| static void _sort_based_on_operation(t_stack **p_a, t_stack **p_b) | ||
| { | ||
| char *op; | ||
|
|
||
| while (true) | ||
| { | ||
| op = get_next_line(STDIN_FILENO); | ||
| if (!op) | ||
| break ; | ||
| if (!_is_operation_present(op)) | ||
| exit_with_error(); | ||
| _stack_operation(p_a, p_b, op); | ||
| } | ||
| } | ||
| # endif | ||
| #endif | ||
|
|
||
| static void _check_sorted(t_stack *st_a, int size_a) | ||
| { | ||
| if (stack_size(st_a) != size_a) | ||
| { | ||
| ft_putendl_fd("KO", STDOUT_FILENO); | ||
| return ; | ||
| } | ||
| if (is_sorted_stack(st_a)) | ||
| ft_putendl_fd("OK", STDOUT_FILENO); | ||
| else | ||
|
|
@@ -89,7 +50,9 @@ int main(int argc, char **argv) | |
| check_args(argc, argv); | ||
| st_a = generate_stack(argc, argv); | ||
| st_b = NULL; | ||
| _sort_based_on_operation(&st_a, &st_b); | ||
| sort_based_on_operation(&st_a, &st_b); | ||
| _check_sorted(st_a, argc - 1); | ||
| clear_stack(&st_a, free); | ||
| clear_stack(&st_b, free); | ||
| return (0); | ||
| } | ||
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,70 @@ | ||
| /* ************************************************************************** */ | ||
| /* */ | ||
| /* ::: :::::::: */ | ||
| /* sort_based_on_operation.c :+: :+: :+: */ | ||
| /* +:+ +:+ +:+ */ | ||
| /* By: reasuke <[email protected]> +#+ +:+ +#+ */ | ||
| /* +#+#+#+#+#+ +#+ */ | ||
| /* Created: 2024/02/19 12:10:41 by reasuke #+# #+# */ | ||
| /* Updated: 2024/02/19 12:48:45 by reasuke ### ########.fr */ | ||
| /* */ | ||
| /* ************************************************************************** */ | ||
|
|
||
| #include "checker.h" | ||
| #include "initialization.h" | ||
| #include "stack_operations.h" | ||
|
|
||
| static bool _is_operation_present(const char *op) | ||
| { | ||
| bool present; | ||
|
|
||
| present = false; | ||
| present |= !ft_strcmp(op, "sa\n"); | ||
| present |= !ft_strcmp(op, "sb\n"); | ||
| present |= !ft_strcmp(op, "ss\n"); | ||
| present |= !ft_strcmp(op, "pa\n"); | ||
| present |= !ft_strcmp(op, "pb\n"); | ||
| present |= !ft_strcmp(op, "ra\n"); | ||
| present |= !ft_strcmp(op, "rb\n"); | ||
| present |= !ft_strcmp(op, "rr\n"); | ||
| present |= !ft_strcmp(op, "rra\n"); | ||
| present |= !ft_strcmp(op, "rrb\n"); | ||
| present |= !ft_strcmp(op, "rrr\n"); | ||
| return (present); | ||
| } | ||
|
|
||
| static void _stack_operation(t_stack **p_a, t_stack **p_b, const char *op) | ||
| { | ||
| if (!ft_strcmp(op, "sa\n") || !ft_strcmp(op, "ss\n")) | ||
| swap_stack(p_a); | ||
| if (!ft_strcmp(op, "sb\n") || !ft_strcmp(op, "ss\n")) | ||
| swap_stack(p_b); | ||
| if (!ft_strcmp(op, "pa\n")) | ||
| push_stack(p_b, p_a); | ||
| if (!ft_strcmp(op, "pb\n")) | ||
| push_stack(p_a, p_b); | ||
| if (!ft_strcmp(op, "ra\n") || !ft_strcmp(op, "rr\n")) | ||
| rotate_stack(p_a); | ||
| if (!ft_strcmp(op, "rb\n") || !ft_strcmp(op, "rr\n")) | ||
| rotate_stack(p_b); | ||
| if (!ft_strcmp(op, "rra\n") || !ft_strcmp(op, "rrr\n")) | ||
| reverse_rotate_stack(p_a); | ||
| if (!ft_strcmp(op, "rrb\n") || !ft_strcmp(op, "rrr\n")) | ||
| reverse_rotate_stack(p_b); | ||
| } | ||
|
|
||
| void sort_based_on_operation(t_stack **p_a, t_stack **p_b) | ||
| { | ||
| char *op; | ||
|
|
||
| while (true) | ||
| { | ||
| op = get_next_line(STDIN_FILENO); | ||
| if (!op) | ||
| break ; | ||
| if (!_is_operation_present(op)) | ||
| exit_with_error(); | ||
| _stack_operation(p_a, p_b, op); | ||
| free(op); | ||
| } | ||
| } |
Oops, something went wrong.