forked from bjssacademy/stackmachine
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathstackmachine_operations.go
More file actions
104 lines (81 loc) · 2.34 KB
/
Copy pathstackmachine_operations.go
File metadata and controls
104 lines (81 loc) · 2.34 KB
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
package main
import (
"errors"
)
func isNumberOutOfBounds(num int) bool {
return num < 0 || num > MAX_NUMBER_LIMIT
}
func (m *Machine) isStackEmpty() bool {
if len(m.stack) == 0 {
return true
}
return false
}
func (m *Machine) notEnoughNumsInStack(minimum int) bool {
if len(m.stack) < minimum {
return true
}
return false
}
func (m *Machine) processDUPOperation() {
lastNumInStack := m.getNumFromBackOfStack(1)
m.appendToStack(lastNumInStack)
}
func (m *Machine) processPOPOperation() {
m.removeElementsFromStack(1)
}
func (m *Machine) processAddOperation() error {
lastNumInStack, secondLastNumInStack := m.getNumbersForDoubleOps()
numTotal := lastNumInStack + secondLastNumInStack
if isNumberOutOfBounds(numTotal) {
return errors.New("stack integer add overflow")
}
m.processNumberOperationOnStack(numTotal, 2)
return nil
}
func (m *Machine) processMinusOperation() error {
lastNumInStack, secondLastNumInStack := m.getNumbersForDoubleOps()
result := lastNumInStack - secondLastNumInStack
if isNumberOutOfBounds(result) {
return errors.New("stack integer underflow")
}
m.processNumberOperationOnStack(result, 2)
return nil
}
func (m *Machine) processMultiplyOperation() error {
lastNumInStack, secondLastNumInStack := m.getNumbersForDoubleOps()
result := lastNumInStack * secondLastNumInStack
if isNumberOutOfBounds(result) {
return errors.New("stack integer overflow")
}
m.processNumberOperationOnStack(result, 2)
return nil
}
func (m *Machine) processSUMOperation() error {
var sumTotal int
for _, num := range m.stack {
sumTotal += num
if isNumberOutOfBounds(sumTotal) {
return errors.New("stack integer sum overflow")
}
}
stackLength := len(m.stack)
m.processNumberOperationOnStack(sumTotal, stackLength)
return nil
}
func (m *Machine) appendToStack(num int) {
m.stack = append(m.stack, num)
}
func (m *Machine) getNumFromBackOfStack(inverseIndex int) int {
return m.stack[len(m.stack)-inverseIndex]
}
func (m *Machine) getNumbersForDoubleOps() (int, int) {
return m.stack[len(m.stack)-1], m.stack[len(m.stack)-2]
}
func (m *Machine) removeElementsFromStack(numberOfElements int) {
m.stack = m.stack[:len(m.stack)-numberOfElements]
}
func (m *Machine) processNumberOperationOnStack(resultToAppend int, numOfNumsToRemove int) {
m.removeElementsFromStack(numOfNumsToRemove)
m.appendToStack(resultToAppend)
}