blob: 6875862bd6bb26ec2892c5f96e04961163956993 (
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
|
/* ************************************************************************** */
/* */
/* ::: :::::::: */
/* stack_core.c :+: :+: :+: */
/* +:+ +:+ +:+ */
/* By: cacharle <marvin@42.fr> +#+ +:+ +#+ */
/* +#+#+#+#+#+ +#+ */
/* Created: 2020/01/19 06:37:45 by cacharle #+# #+# */
/* Updated: 2020/01/19 06:50:50 by cacharle ### ########.fr */
/* */
/* ************************************************************************** */
#include "common.h"
t_stack *stack_new(int size)
{
t_stack *stack;
if ((stack = (t_stack*)malloc(sizeof(t_stack))) == NULL)
return (NULL);
if ((stack->elements = (int*)malloc(sizeof(int) * size)) == NULL)
{
free(stack);
return (NULL);
}
stack->top = -1;
return (stack);
}
void stack_destroy(t_stack *stack)
{
if (stack == NULL)
return ;
free(stack->elements);
free(stack);
}
void stack_push(t_stack *stack, int 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]);
}
|
