-
Notifications
You must be signed in to change notification settings - Fork 2
/
Copy patharithmetic_operations.c
114 lines (97 loc) · 2.32 KB
/
arithmetic_operations.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
#include "monty.h"
/**
* add-adds the top two elements of the stack
* @stack: pointer to a pointer to the stack
* @line_number: line number
*/
void add(stack_t **stack, unsigned int line_number)
{
int top_element;
if (size(monty_list) < 2)
{
fprintf(stderr, "L%u: can't add, stack too short\n", line_number);
handle_exit();
}
top_element = top(monty_list);
pop(stack, line_number);
(*stack)->n += top_element;
}
/**
* sub - subtracts the top two elements of the stack
* @stack: pointer to a pointer to the stack
* @line_number: line number
*/
void sub(stack_t **stack, unsigned int line_number)
{
int top_element;
if (size(monty_list) < 2)
{
fprintf(stderr, "L%u: can't sub, stack too short\n", line_number);
handle_exit();
}
top_element = top(monty_list);
pop(stack, line_number);
(*stack)->n -= top_element;
}
/**
* mul - multiplies the top two elements of the stack
* @stack: pointer to a pointer to the stack
* @line_number: line number
*/
void mul(stack_t **stack, unsigned int line_number)
{
int top_element;
if (size(monty_list) < 2)
{
fprintf(stderr, "L%u: can't mul, stack too short\n", line_number);
handle_exit();
}
top_element = top(monty_list);
pop(stack, line_number);
(*stack)->n *= top_element;
}
/**
* division - divides the top two elements of the stack
* @stack: pointer to a pointer to the stack
* @line_number: line number
*/
void division(stack_t **stack, unsigned int line_number)
{
int top_element;
if (size(monty_list) < 2)
{
fprintf(stderr, "L%u: can't div, stack too short\n", line_number);
handle_exit();
}
top_element = top(monty_list);
if (top_element == 0)
{
fprintf(stderr, "L%u: division by zero\n", line_number);
handle_exit();
}
pop(stack, line_number);
(*stack)->n /= top_element;
}
/**
* mod - performs modulo arithmetic on the top two elements of the stack
* top element of the stack
* @stack: pointer to a pointer to the stack
* @line_number: line number
*/
void mod(stack_t **stack, unsigned int line_number)
{
int top_element;
if (size(monty_list) < 2)
{
fprintf(stderr, "L%u: can't mod, stack too short\n", line_number);
handle_exit();
}
top_element = top(monty_list);
if (top_element == 0)
{
fprintf(stderr, "L%u: division by zero\n", line_number);
handle_exit();
}
pop(stack, line_number);
(*stack)->n %= top_element;
}