-
Notifications
You must be signed in to change notification settings - Fork 3
/
choose_option_2.c
133 lines (117 loc) · 2.38 KB
/
choose_option_2.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
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
#include "monty.h"
/**
* mega_pint - Add a new node at the end of a list
*
* @stack: address of double linked list
* @line_number: number of line
*
*/
void mega_pint(stack_t **stack, unsigned int line_number)
{
stack_t *tmp = *stack;
if (!tmp)
{
dprintf(STDERR_FILENO, "L%d: can't pint, stack empty\n", line_number);
freell(stack);
exit(EXIT_FAILURE);
}
for (; tmp->next; tmp = tmp->next)
;
printf("%d\n", tmp->n);
}
/**
* m_pop - Function that removes the top element of the stack
*
* @stack: address of double linked list
* @line_number: number of line
*
*/
void m_pop(stack_t **stack, unsigned int line_number)
{
stack_t *tmp = *stack, *tmp2 = NULL;
if (!tmp)
{
dprintf(STDERR_FILENO, "L%d: can't pop an empty stack\n", line_number);
freell(stack);
exit(EXIT_FAILURE);
}
if (!(*stack)->next)
{
free(*stack);
*stack = NULL;
return;
}
for (; tmp && tmp->next; tmp = tmp->next)
;
tmp2 = tmp;
tmp->prev->next = NULL;
free(tmp2);
}
/**
* m_swap - Function that swaps the top two elements of the stack
*
* @stack: address of double linked list
* @line_number: number of line
*
*/
void m_swap(stack_t **stack, unsigned int line_number)
{
stack_t *tmp = *stack;
size_t i = 1;
for (; tmp && tmp->next; tmp = tmp->next, i++)
;
if (i < 2)
{
dprintf(STDERR_FILENO, "L%d: can't swap, stack too short\n", line_number);
freell(stack);
exit(EXIT_FAILURE);
}
if (i == 2)
{
(*stack)->prev = tmp;
tmp->next = (*stack);
(*stack)->next = NULL;
*stack = tmp;
(*stack)->prev = NULL;
return;
}
tmp->prev = tmp->prev->prev;
tmp->prev->next->next = NULL;
tmp->next = tmp->prev->next;
tmp->prev->next->prev = tmp;
tmp->prev->next = tmp;
}
/**
* m_add - Function that adds the top two elements of the stack
*
* @stack: address of double linked list
* @line_number: number of line
*
*/
void m_add(stack_t **stack, unsigned int line_number)
{
stack_t *tmp = *stack;
size_t i = 1;
for (; tmp && tmp->next; tmp = tmp->next, i++)
;
if (i < 2)
{
dprintf(STDERR_FILENO, "L%d: can't add, stack too short\n", line_number);
freell(stack);
exit(EXIT_FAILURE);
}
tmp->prev->n += tmp->n;
m_pop(stack, line_number);
}
/**
* m_nop - Function that doesn't do anything
*
* @stack: address of double linked list
* @line_number: number of line
*
*/
void m_nop(stack_t **stack, unsigned int line_number)
{
(void)stack;
(void)line_number;
}