-
Notifications
You must be signed in to change notification settings - Fork 0
/
stack_functions.c
100 lines (83 loc) · 1.51 KB
/
stack_functions.c
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
87
88
89
90
91
92
93
94
95
96
97
98
99
100
#include "monty.h"
/**
* print_all - print all values in the stack.
*
* @stack: double pointer to the stack.
* @line_number: line number.
*
*/
void print_all(stack_t **stack, unsigned int line_number)
{
stack_t *tmp;
(void)line_number;
tmp = *stack;
while (tmp != NULL)
{
printf("%d\n", tmp->n);
tmp = tmp->next;
}
}
/**
* print_int - print top of the stack.
*
* @stack: the stack.
* @line_number: line number.
*/
void print_int(stack_t **stack, unsigned int line_number)
{
if (*stack == NULL)
error(6, line_number);
else
printf("%d\n", (*stack)->n);
}
/**
* swap - swap the top node with the next.
*
* @stack: the stack.
* @line_number: line number.
*/
void swap(stack_t **stack, unsigned int line_number)
{
stack_t *current;
stack_t *next;
if (*stack == NULL || (*stack)->next == NULL)
{
error(8, line_number);
return;
}
current = *stack;
next = current->next;
next->prev = current->prev;
current->next = next->next;
next->next = current;
*stack = next;
}
/**
* nop - no operation.
*
* @stack: the stack.
* @line_number: line number.
*/
void nop(stack_t **stack, unsigned int line_number)
{
(void)stack;
(void)line_number;
}
/**
* add - add n of top stack node to n of next node to it.
*
* @stack: the stack.
* @line_number: line number.
*/
void add(stack_t **stack, unsigned int line_number)
{
stack_t *tmp = *stack;
if (*stack == NULL || (*stack)->next == NULL)
{
error(9, line_number);
return;
}
tmp->next->n += tmp->n;
*stack = tmp->next;
free(tmp);
}