diff options
| author | Charles <sircharlesaze@gmail.com> | 2020-01-15 14:19:33 +0100 |
|---|---|---|
| committer | Charles <sircharlesaze@gmail.com> | 2020-01-15 14:19:33 +0100 |
| commit | 7dce30ca733f6b310f997c4515e486718b273d44 (patch) | |
| tree | 97f6d7e8776accecd2e50a5df73c1237a0a1dabe /src/common/stack.c | |
| parent | f061613650f5e7c5e260a4d9a1ca1b1d80ca2f2c (diff) | |
| download | push_swap-7dce30ca733f6b310f997c4515e486718b273d44.tar.gz push_swap-7dce30ca733f6b310f997c4515e486718b273d44.tar.bz2 push_swap-7dce30ca733f6b310f997c4515e486718b273d44.zip | |
WIP: Checker base
Diffstat (limited to 'src/common/stack.c')
| -rw-r--r-- | src/common/stack.c | 26 |
1 files changed, 24 insertions, 2 deletions
diff --git a/src/common/stack.c b/src/common/stack.c index 693fb85..02d3207 100644 --- a/src/common/stack.c +++ b/src/common/stack.c @@ -11,7 +11,7 @@ t_stack *stack_new(int size) free(stack); return (NULL); } - stack->top = 0; + stack->top = -1; return (stack); } @@ -25,17 +25,21 @@ void stack_destroy(t_stack *stack) void stack_push(t_stack *stack, int n) { - stack->elements[stack->top] = n; stack->top++; + stack->elements[stack->top] = n; } void stack_pop(t_stack *stack) { + if (stack_empty(stack)) + return ; stack->top--; } int stack_peek(t_stack *stack) { + if (stack_empty(stack)) + return (0); return (stack->elements[stack->top]); } @@ -44,6 +48,8 @@ void stack_swap(t_stack *stack) int first; int second; + if (stack_length(stack) < 2) + return ; first = stack_peek(stack); stack_pop(stack); second = stack_peek(stack); @@ -56,6 +62,8 @@ void stack_push_to(t_stack *from, t_stack *to) { int tmp; + if (stack_empty(from)) + return ; tmp = stack_peek(from); stack_pop(from); stack_push(to, tmp); @@ -65,6 +73,8 @@ void stack_rotate(t_stack *stack) { int tmp; + if (stack_length(stack) < 2) + return ; tmp = stack_peek(stack); ft_memmove(&stack->elements[1], stack->elements, sizeof(int) * stack->top); stack->elements[0] = tmp; @@ -74,7 +84,19 @@ void stack_reverse_rotate(t_stack *stack) { int tmp; + if (stack_length(stack) < 2) + return ; tmp = stack->elements[0]; ft_memmove(stack->elements, &stack->elements[1], sizeof(int) * stack->top); stack_push(stack, tmp); } + +t_bool stack_empty(t_stack *stack) +{ + return (stack->top == -1); +} + +int stack_length(t_stack *stack) +{ + return (stack->top + 1); +} |
