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
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
|
// SPDX-License-Identifier: MIT
// Copyright (c) 2026 Paul Buetow
package rpn
import (
"fmt"
"math"
)
// HyperOperations provides hyper operator implementations.
type HyperOperations struct {
mode CalculationMode
}
// NewHyperOperations creates a new HyperOperations instance.
func NewHyperOperations(mode CalculationMode) *HyperOperations {
return &HyperOperations{mode: mode}
}
// HyperAdd pops all values from stack, sums them, and pushes result.
func (o *HyperOperations) HyperAdd(stack *Stack) error {
if stack.Len() < 2 {
return fmt.Errorf("insufficient operands for hyperadd: need at least 2 values")
}
// Pop all values into a slice (in reverse order - top first)
var values []Number
for stack.Len() > 0 {
val, err := stack.Pop()
if err != nil {
return fmt.Errorf("hyperadd: %w", err)
}
values = append(values, val)
}
// Reverse to get left-to-right order (first pushed = first in)
for i, j := 0, len(values)-1; i < j; i, j = i+1, j-1 {
values[i], values[j] = values[j], values[i]
}
// Process left-associative with Number interface
sum := 0.0
for i := 0; i < len(values); i++ {
val, err := values[i].Float64()
if err != nil {
return fmt.Errorf("hyperadd: failed to get float64 value: %w", err)
}
sum += val
}
stack.Push(NewNumber(sum, o.mode))
return nil
}
// HyperMultiply pops all values from stack, multiplies them left-associative, and pushes result.
func (o *HyperOperations) HyperMultiply(stack *Stack) error {
if stack.Len() < 2 {
return fmt.Errorf("insufficient operands for hypermultiply: need at least 2 values")
}
product := 1.0
for stack.Len() > 0 {
val, err := stack.Pop()
if err != nil {
return fmt.Errorf("hypermultiply: %w", err)
}
floatVal, err := val.Float64()
if err != nil {
return fmt.Errorf("hypermultiply: failed to get float64 value: %w", err)
}
product *= floatVal
}
stack.Push(NewNumber(product, o.mode))
return nil
}
// HyperSubtract pops all values from stack, subtracts them left-associative, and pushes result.
func (o *HyperOperations) HyperSubtract(stack *Stack) error {
if stack.Len() < 2 {
return fmt.Errorf("insufficient operands for hypersubtract: need at least 2 values")
}
// Pop all values into a slice (in reverse order - top first)
var values []Number
for stack.Len() > 0 {
val, err := stack.Pop()
if err != nil {
return fmt.Errorf("hypersubtract: %w", err)
}
values = append(values, val)
}
// Reverse to get left-to-right order (first pushed = first in)
for i, j := 0, len(values)-1; i < j; i, j = i+1, j-1 {
values[i], values[j] = values[j], values[i]
}
// Process left-associative with Number interface
firstVal, err := values[0].Float64()
if err != nil {
return fmt.Errorf("hypersubtract: failed to get float64 value: %w", err)
}
result := firstVal
for i := 1; i < len(values); i++ {
val, err := values[i].Float64()
if err != nil {
return fmt.Errorf("hypersubtract: failed to get float64 value: %w", err)
}
result -= val
}
stack.Push(NewNumber(result, o.mode))
return nil
}
// HyperDivide pops all values from stack, divides them left-associative, and pushes result.
func (o *HyperOperations) HyperDivide(stack *Stack) error {
if stack.Len() < 2 {
return fmt.Errorf("insufficient operands for hyperdivide: need at least 2 values")
}
// Pop all values into a slice (in reverse order - top first)
var values []Number
for stack.Len() > 0 {
val, err := stack.Pop()
if err != nil {
return fmt.Errorf("hyperdivide: %w", err)
}
values = append(values, val)
}
// Reverse to get left-to-right order (first pushed = first in)
for i, j := 0, len(values)-1; i < j; i, j = i+1, j-1 {
values[i], values[j] = values[j], values[i]
}
// Process left-associative with Number interface
firstVal, err := values[0].Float64()
if err != nil {
return fmt.Errorf("hyperdivide: failed to get float64 value: %w", err)
}
result := firstVal
for i := 1; i < len(values); i++ {
val, err := values[i].Float64()
if err != nil {
return fmt.Errorf("hyperdivide: failed to get float64 value: %w", err)
}
if val == 0 {
return fmt.Errorf("division by zero")
}
result /= val
}
stack.Push(NewNumber(result, o.mode))
return nil
}
// HyperPower pops all values from stack, raises to power left-associative, and pushes result.
func (o *HyperOperations) HyperPower(stack *Stack) error {
if stack.Len() < 2 {
return fmt.Errorf("insufficient operands for hyperpower: need at least 2 values")
}
// Pop all values into a slice (in reverse order - top first)
var values []Number
for stack.Len() > 0 {
val, err := stack.Pop()
if err != nil {
return fmt.Errorf("hyperpower: %w", err)
}
values = append(values, val)
}
// Reverse to get left-to-right order (first pushed = first in)
for i, j := 0, len(values)-1; i < j; i, j = i+1, j-1 {
values[i], values[j] = values[j], values[i]
}
// Process left-associative with Number interface
firstVal, err := values[0].Float64()
if err != nil {
return fmt.Errorf("hyperpower: failed to get float64 value: %w", err)
}
result := firstVal
for i := 1; i < len(values); i++ {
val, err := values[i].Float64()
if err != nil {
return fmt.Errorf("hyperpower: failed to get float64 value: %w", err)
}
result = math.Pow(result, val)
}
stack.Push(NewNumber(result, o.mode))
return nil
}
// HyperModulo pops all values from stack, computes modulo left-associative, and pushes result.
func (o *HyperOperations) HyperModulo(stack *Stack) error {
if stack.Len() < 2 {
return fmt.Errorf("insufficient operands for hypermodulo: need at least 2 values")
}
// Pop all values into a slice (in reverse order - top first)
var values []Number
for stack.Len() > 0 {
val, err := stack.Pop()
if err != nil {
return fmt.Errorf("hypermodulo: %w", err)
}
values = append(values, val)
}
// Reverse to get left-to-right order (first pushed = first in)
for i, j := 0, len(values)-1; i < j; i, j = i+1, j-1 {
values[i], values[j] = values[j], values[i]
}
// Process left-associative with Number interface
firstVal, err := values[0].Float64()
if err != nil {
return fmt.Errorf("hypermodulo: failed to get float64 value: %w", err)
}
result := firstVal
for i := 1; i < len(values); i++ {
val, err := values[i].Float64()
if err != nil {
return fmt.Errorf("hypermodulo: failed to get float64 value: %w", err)
}
if val == 0 {
return fmt.Errorf("modulo by zero")
}
result = math.Mod(result, val)
}
stack.Push(NewNumber(result, o.mode))
return nil
}
// HyperLog2 pops all values from stack, computes sum of log2 for all values, and pushes result.
// This follows the same pattern as HyperAdd (sum) and HyperMultiply (product).
func (o *HyperOperations) HyperLog2(stack *Stack) error {
if stack.Len() < 2 {
return fmt.Errorf("insufficient operands for hyperlog2: need at least 2 values")
}
// Pop all values into a slice (in reverse order - top first)
var values []Number
for stack.Len() > 0 {
val, err := stack.Pop()
if err != nil {
return fmt.Errorf("hyperlog2: %w", err)
}
values = append(values, val)
}
// Reverse to get left-to-right order (first pushed = first in)
for i, j := 0, len(values)-1; i < j; i, j = i+1, j-1 {
values[i], values[j] = values[j], values[i]
}
// Sum the log2 of all values with Number interface
var result float64 = 0
for i := 0; i < len(values); i++ {
val, err := values[i].Float64()
if err != nil {
return fmt.Errorf("hyperlog2: failed to get float64 value: %w", err)
}
if val <= 0 {
return fmt.Errorf("hyperlog2 undefined for non-positive numbers")
}
result += math.Log2(val)
}
// Push the result as a Number
stack.Push(NewNumber(result, o.mode))
return nil
}
// HyperLog10 pops all values from stack, computes sum of log10 for all values, and pushes result.
// This follows the same pattern as HyperAdd (sum) and HyperMultiply (product).
func (o *HyperOperations) HyperLog10(stack *Stack) error {
if stack.Len() < 2 {
return fmt.Errorf("insufficient operands for hyperlog10: need at least 2 values")
}
// Pop all values into a slice (in reverse order - top first)
var values []Number
for stack.Len() > 0 {
val, err := stack.Pop()
if err != nil {
return fmt.Errorf("hyperlog10: %w", err)
}
values = append(values, val)
}
// Reverse to get left-to-right order (first pushed = first in)
for i, j := 0, len(values)-1; i < j; i, j = i+1, j-1 {
values[i], values[j] = values[j], values[i]
}
// Sum the log10 of all values
var result float64 = 0
for i := 0; i < len(values); i++ {
val, err := values[i].Float64()
if err != nil {
return fmt.Errorf("hyperlog10: failed to get float64 value: %w", err)
}
if val <= 0 {
return fmt.Errorf("hyperlog10 undefined for non-positive numbers")
}
result += math.Log10(val)
}
// Push the result as a Number
stack.Push(NewNumber(result, o.mode))
return nil
}
// HyperLn pops all values from stack, computes sum of natural log for all values, and pushes result.
// This follows the same pattern as HyperAdd (sum) and HyperMultiply (product).
func (o *HyperOperations) HyperLn(stack *Stack) error {
if stack.Len() < 2 {
return fmt.Errorf("insufficient operands for hyperln: need at least 2 values")
}
// Pop all values into a slice (in reverse order - top first)
var values []Number
for stack.Len() > 0 {
val, err := stack.Pop()
if err != nil {
return fmt.Errorf("hyperln: %w", err)
}
values = append(values, val)
}
// Reverse to get left-to-right order (first pushed = first in)
for i, j := 0, len(values)-1; i < j; i, j = i+1, j-1 {
values[i], values[j] = values[j], values[i]
}
// Sum the natural log of all values with Number interface
var result float64 = 0
for i := 0; i < len(values); i++ {
val, err := values[i].Float64()
if err != nil {
return fmt.Errorf("hyperln: failed to get float64 value: %w", err)
}
if val <= 0 {
return fmt.Errorf("hyperln undefined for non-positive numbers")
}
result += math.Log(val)
}
stack.Push(NewNumber(result, o.mode))
return nil
}
|
