Added micro optimisation when sorting frame == 2 and less reverse rotate when frame == full stack, norming

1 files changed, 6 insertions, 6 deletions

diff --git a/src/common/stack_core.c b/src/common/stack_core.c
index bf766d4..adab5b1 100644
--- a/src/common/stack_core.c
+++ b/src/common/stack_core.c
@@ -6,13 +6,13 @@
 /*   By: cacharle <marvin@42.fr>                    +#+  +:+       +#+        */
 /*                                                +#+#+#+#+#+   +#+           */
 /*   Created: 2020/01/19 06:37:45 by cacharle          #+#    #+#             */
-/*   Updated: 2020/01/19 13:33:08 by cacharle         ###   ########.fr       */
+/*   Updated: 2020/01/22 10:23:18 by cacharle         ###   ########.fr       */
 /*                                                                            */
 /* ************************************************************************** */
 
 #include "common.h"
 
-t_stack *stack_new(int size)
+t_stack	*stack_new(int size)
 {
 	t_stack *stack;
 
@@ -28,7 +28,7 @@ t_stack *stack_new(int size)
 	return (stack);
 }
 
-void stack_destroy(t_stack *stack)
+void	stack_destroy(t_stack *stack)
 {
 	if (stack == NULL)
 		return ;
@@ -36,20 +36,20 @@ void stack_destroy(t_stack *stack)
 	free(stack);
 }
 
-void stack_push(t_stack *stack, int n)
+void	stack_push(t_stack *stack, int n)
 {
 	stack->top++;
 	stack->elements[stack->top] = n;
 }
 
-void stack_pop(t_stack *stack)
+void	stack_pop(t_stack *stack)
 {
 	if (stack_empty(stack))
 		return ;
 	stack->top--;
 }
 
-int  stack_peek(t_stack *stack)
+int		stack_peek(t_stack *stack)
 {
 	if (stack_empty(stack))
 		return (0);