summaryrefslogtreecommitdiff
path: root/stack_utils.c
blob: f240395ba6578938d97a1c40729ceba3d0a10ba8 (plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
/* ************************************************************************** */
/*                                                                            */
/*                                                        :::      ::::::::   */
/*   stack_utils.c                                      :+:      :+:    :+:   */
/*                                                    +:+ +:+         +:+     */
/*   By: dkaiser <dkaiser@student.42heilbronn.de    +#+  +:+       +#+        */
/*                                                +#+#+#+#+#+   +#+           */
/*   Created: 2024/04/12 20:31:30 by dkaiser           #+#    #+#             */
/*   Updated: 2024/04/15 21:53:40 by dkaiser          ###   ########.fr       */
/*                                                                            */
/* ************************************************************************** */

#include "push_swap.h"

void	stack_swap(t_stack *stack)
{
	int tmp;

	if (stack->size > 1)
	{
		tmp = stack->stack[0];
		stack->stack[0] = stack->stack[1];
		stack->stack[1] = tmp;
	}
}

void	stack_push(t_stack *dst_stack, t_stack *src_stack)
{
	int i;

	i = dst_stack->size;
	while (i > 0)
	{
		dst_stack->stack[i] = dst_stack->stack[i-1];
		i--;
	}
	dst_stack->stack[0] = src_stack->stack[0];
	dst_stack->size++;
	i = 1;
	while (i < src_stack->size)
	{
		src_stack->stack[i-1] = src_stack->stack[i];
		i++;
	}
	src_stack->size--;
}

void	stack_rotate(t_stack *stack)
{
	int tmp;
	int i;

	tmp = stack->stack[0];
	i = 1;
	while (i < stack->size)
	{
		stack->stack[i-1] = stack->stack[i];
		i++;
	}
	stack->stack[i-1] = tmp;
}

void	stack_rrotate(t_stack *stack)
{
	int tmp;
	int i;

	i = stack->size - 1;
	tmp = stack->stack[i];
	while (i > 0)
	{
		stack->stack[i] = stack->stack[i-1];
		i--;
	}
	stack->stack[0] = tmp;
}

void stack_print(t_stack *stack)
{
	int i;

	i = 0;
	while (i < stack->size)
		ft_printf("%d ", stack->stack[i++]);
	ft_printf("\n");
}