da7e/42-Push_Swap
1
0
Fork 0
mirror of https://github.com/DavidGailleton/42-Push_Swap.git synced 2026-01-27 08:41:58 +00:00
Code Issues Packages Projects Releases Wiki Activity

all basics functions has been tested we can start the sort algorithms

Browse Source
This commit is contained in:
Maoake Teriierooiterai
2025-12-09 11:42:37 +01:00
parent 30b306d2c2
commit 67d7509faf
9 changed files with 99 additions and 38 deletions
Download Patch File Download Diff File Expand all files Collapse all files

BIN
stack_utils/.push.c.swp Normal file
View File

Binary file not shown.

BIN
stack_utils/.stack_add.c.swp Normal file
View File

Binary file not shown.

34
stack_utils/push.c
View File

@@ -6,28 +6,48 @@
/* By: mteriier <mteriier@student.42lyon.fr> +#+ +:+ +#+ */
/* +#+#+#+#+#+ +#+ */
/* Created: 2025/12/08 15:09:40 by mteriier #+# #+# */
/* Updated: 2025/12/08 19:37:01 by mteriier ### ########.fr */
/* Updated: 2025/12/09 11:36:36 by mteriier ### ########lyon.fr */
/* */
/* ************************************************************************** */
#include "../push_swap.h"
#include <stdlib.h>
void pa(t_stacks *stacks)
{
t_stack *a;
t_stack *b_push;
if (!stacks || !stacks->b)
return ;
a = stacks->a;
a->value = stacks->b->value;
b_push = stacks->b;
if (stacks->b->next == stacks->b)
stacks->b = NULL;
else
{
stacks->b->next->previous = stacks->b->previous;
stacks->b->previous->next = stacks->b->next;
stacks->b = stacks->b->next;
}
stack_add_front(&(stacks->a), b_push);
}
#include <stdio.h>
void pb(t_stacks *stacks)
{
t_stack *b;
t_stack *a_push;
if (!stacks || !stacks->a)
return ;
b = stacks->b;
b->value = stacks->a->value;
a_push = stacks->a;
if (stacks->a->next == stacks->a)
stacks->a = NULL;
else
{
stacks->a->next->previous = stacks->a->previous;
stacks->a->previous->next = stacks->a->next;
stacks->a = stacks->a->next;
}
stack_add_front(&(stacks->b), a_push);
}

4
stack_utils/stack_add.c
View File

@@ -6,7 +6,7 @@
/* By: dgaillet <dgaillet@student.42.fr> +#+ +:+ +#+ */
/* +#+#+#+#+#+ +#+ */
/* Created: 2025/12/08 15:52:40 by dgaillet #+# #+# */
/* Updated: 2025/12/08 20:33:58 by mteriier ### ########.fr */
/* Updated: 2025/12/09 08:51:33 by mteriier ### ########lyon.fr */
/* */
/* ************************************************************************** */
@@ -26,8 +26,6 @@ t_stack *new_stack(int value)
return (new);
}
#include <stdio.h>
void stack_add_back(t_stack **stack, t_stack *new)
{
if (!stack || !new)