-
Notifications
You must be signed in to change notification settings - Fork 1
/
stack.g
253 lines (164 loc) · 3.49 KB
/
stack.g
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
//genesis
//
// $Id: stack.g 1.3 Thu, 04 Apr 2002 11:55:56 +0200 hugo $
//
//////////////////////////////////////////////////////////////////////////////
//'
//' Purkinje tutorial
//'
//' (C) 1998-2002 BBF-UIA
//'
//' see our site at http://www.bbf.uia.ac.be/ for more information regarding
//' the Purkinje cell and genesis simulation software.
//'
//'
//' functional ideas ... Erik De Schutter, [email protected]
//' genesis coding ..... Hugo Cornelis, [email protected]
//'
//' general feedback ... Reinoud Maex, Erik De Schutter
//'
//////////////////////////////////////////////////////////////////////////////
// stack.g : a simple stack implementation
int include_stack
if ( {include_stack} == 0 )
include_stack = 1
include utility.g
extern StackCreate
extern StackPop
extern StackPush
extern StackTopElement
extern StackTop
///
/// SH: StackCreate
///
/// PA: path..: path to contain stack elements ending in '/'
///
/// DE: Create a stack
///
function StackCreate(path)
str path
//- create stack container
create neutral {path}stack
//- add field for number of elements
addfield {path}stack \
elements -description "Number of elements -1 in stack"
//- initialize field
setfield {path}stack elements -1
end
///
/// SH: StackDelete
///
/// PA: path..: path with stack elements ending in '/'
///
/// DE: Delete stack
///
function StackDelete(path)
str path
//- delete stack container
delete {path}stack
end
///
/// SH: StackNumberOfElements
///
/// PA: path..: path with stack elements ending in '/'
///
/// RE: number of values in stack
///
/// DE: Get number of values in stack
///
function StackNumberOfElements(path)
str path
return {{getfield {path}stack elements} + 1}
end
///
/// SH: StackPop
///
/// PA: path..: path with stack elements ending in '/'
///
/// RE: value of previous top of stack
///
/// DE: Pop value onto stack
///
function StackPop(path)
str path
str top
str val
//- get number of elements in stack
int iElements = {StackNumberOfElements {path}}
//- if no underflow
if (iElements > 0)
//- get stack top
top = {StackTopElement {path}}
//- get value of stacktop
val = {getfield {top} value}
//- delete top
delete {top}
//- adjust element count
setfield {path}stack \
elements {{getfield {path}stack elements} - 1}
//- else
else
//- set empty result
val = ""
end
//- return value
return {val}
end
///
/// SH: StackPush
///
/// PA: path..: path with stack elements ending in '/'
/// val...: value to push
///
/// DE: Push value onto stack
///
function StackPush(path,val)
str path
str val
//- get stack top
str top = {StackTopElement {path}}
//- create new element
str new = {{top} @ "/1"}
create neutral {new}
//- set value
addfield {new} value
setfield {new} value {val}
//- adjust element count
setfield {path}stack \
elements {{getfield {path}stack elements} + 1}
end
///
/// SH: StackTopElement
///
/// PA: path..: path with stack elements ending in '/'
///
/// RE: top of stack
///
/// DE: Get top of stack
///
function StackTopElement(path)
str path
//- get stack top
str top = {LastArgument {el {path}##}}
//- return element
return {top}
end
///
/// SH: StackTop
///
/// PA: path..: path with stack elements ending in '/'
///
/// RE: value of top of stack
///
/// DE: Get top value of stack
///
function StackTop(path)
str path
//- get stack top
str top = {StackTopElement {path}}
//- get value of stacktop
str val = {getfield {top} value}
//- return value
return {val}
end
end