blob: ac06b438f4ff16257446b85ea49ae6b5f7abe633 (
plain)
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
|
#include <glib.h>
#include "sciteco.h"
#include "undo.h"
#include "expressions.h"
Expressions expressions;
void
Expressions::set_num_sign(gint sign)
{
undo.push_var<gint>(num_sign);
num_sign = sign;
}
void
Expressions::set_radix(gint r)
{
undo.push_var<gint>(radix);
radix = r;
}
gint64
Expressions::push(gint64 number)
{
while (operators.items() && operators.peek() == OP_NEW)
pop_op();
push(OP_NUMBER);
if (num_sign < 0) {
set_num_sign(1);
number *= -1;
}
numbers.undo_pop();
return numbers.push(number);
}
gint64
Expressions::pop_num(int index)
{
gint64 n = 0;
pop_op();
if (numbers.items() > 0) {
n = numbers.pop(index);
numbers.undo_push(n, index);
}
return n;
}
gint64
Expressions::pop_num_calc(int index, gint64 imply)
{
eval();
if (num_sign < 0)
set_num_sign(1);
return args() > 0 ? pop_num(index) : imply;
}
gint64
Expressions::add_digit(gchar digit)
{
gint64 n = args() > 0 ? pop_num() : 0;
return push(n*radix + (n < 0 ? -1 : 1)*(digit - '0'));
}
Expressions::Operator
Expressions::push(Expressions::Operator op)
{
operators.undo_pop();
return operators.push(op);
}
Expressions::Operator
Expressions::push_calc(Expressions::Operator op)
{
int first = first_op();
/* calculate if op has lower precedence than op on stack */
if (first && operators.peek(first) <= op)
calc();
return push(op);
}
Expressions::Operator
Expressions::pop_op(int index)
{
Operator op = OP_NIL;
if (operators.items() > 0) {
op = operators.pop(index);
operators.undo_push(op, index);
}
return op;
}
void
Expressions::calc(void)
{
gint64 result;
gint64 vright = pop_num();
Operator op = pop_op();
gint64 vleft = pop_num();
switch (op) {
case OP_POW: for (result = 1; vright--; result *= vleft); break;
case OP_MUL: result = vleft * vright; break;
case OP_DIV: result = vleft / vright; break;
case OP_MOD: result = vleft % vright; break;
case OP_ADD: result = vleft + vright; break;
case OP_SUB: result = vleft - vright; break;
case OP_AND: result = vleft & vright; break;
case OP_OR: result = vleft | vright; break;
default:
/* shouldn't happen */
g_assert(false);
}
push(result);
}
void
Expressions::eval(bool pop_brace)
{
for (;;) {
gint n = first_op();
Operator op;
if (n < 2)
break;
op = operators.peek(n);
if (op == OP_LOOP)
break;
if (op == OP_BRACE) {
if (pop_brace)
pop_op(n);
break;
}
calc();
}
}
int
Expressions::args(void)
{
int n = 0;
int items = operators.items();
while (n < items && operators.peek(n+1) == OP_NUMBER)
n++;
return n;
}
int
Expressions::find_op(Operator op)
{
int items = operators.items();
for (int i = 1; i <= items; i++)
if (operators.peek(i) == op)
return i;
return 0;
}
int
Expressions::first_op(void)
{
int items = operators.items();
for (int i = 1; i <= items; i++) {
switch (operators.peek(i)) {
case OP_NUMBER:
case OP_NEW:
break;
default:
return i;
}
}
return 0;
}
void
Expressions::discard_args(void)
{
eval();
for (int i = args(); i; i--)
pop_num_calc();
}
|
