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
|
C
C File: sort_IntegerContainer_Impl.f
C Symbol: sort.IntegerContainer-v0.1
C Symbol Type: class
C Babel Version: 0.10.2
C Description: Server-side implementation for sort.IntegerContainer
C
C WARNING: Automatically generated; only changes within splicers preserved
C
C babel-version = 0.10.2
C
C
C Symbol "sort.IntegerContainer" (version 0.1)
C
C Integer container.
C
C DO-NOT-DELETE splicer.begin(_miscellaneous_code_start)
C Insert extra code here...
C DO-NOT-DELETE splicer.end(_miscellaneous_code_start)
C
C Class constructor called when the class is created.
C
subroutine sort_IntegerContainer__ctor_fi(self)
implicit none
C in sort.IntegerContainer self
integer*8 self
C DO-NOT-DELETE splicer.begin(sort.IntegerContainer._ctor)
integer*8 data
data = 0
call sort_IntegerContainer__set_data_f(self, data)
C DO-NOT-DELETE splicer.end(sort.IntegerContainer._ctor)
end
C
C Class destructor called when the class is deleted.
C
subroutine sort_IntegerContainer__dtor_fi(self)
implicit none
C in sort.IntegerContainer self
integer*8 self
C DO-NOT-DELETE splicer.begin(sort.IntegerContainer._dtor)
integer*8 data
call sort_IntegerContainer__get_data_f(self, data)
if (data .ne. 0) then
call sort_Integer__array_deleteRef_f(data)
data = 0
call sort_IntegerContainer__set_data_f(self, data)
endif
C DO-NOT-DELETE splicer.end(sort.IntegerContainer._dtor)
end
C
C Static class initializer called exactly once before any user-defined method is dispatched
C
subroutine sort_IntegerContainer__load_fi()
implicit none
C DO-NOT-DELETE splicer.begin(sort.IntegerContainer._load)
C Insert the implementation here...
C DO-NOT-DELETE splicer.end(sort.IntegerContainer._load)
end
C
C This sets the container length and pseudo-randomly orders the
C Integer elements contained.
C
subroutine sort_IntegerContainer_setLength_fi(self, len)
implicit none
C in sort.IntegerContainer self
integer*8 self
C in int len
integer*4 len
C DO-NOT-DELETE splicer.begin(sort.IntegerContainer.setLength)
integer*8 data, intobj
integer*4 i
if (len .ge. 0) then
call sort_IntegerContainer__get_data_f(self, data)
call sort_Integer__array_deleteRef_f(data)
call sort_Integer__array_create1d_f(len, data)
do i = 0, len - 1
call sort_Integer__create_f(intobj)
call sort_Integer_setValue_f(intobj, i + 1)
if (mod(i,2) .eq. 0) then
call sort_Integer__array_set1_f(data, i/2, intobj)
else
call sort_Integer__array_set1_f(data,
$ len - 1 - i/2, intobj)
endif
call sort_Integer_deleteRef_f(intobj)
enddo
C don't shuffle the list because no standard random number generator
call sort_IntegerContainer__set_data_f(self, data)
endif
C DO-NOT-DELETE splicer.end(sort.IntegerContainer.setLength)
end
C
C Return the number of elements in the container.
C
subroutine sort_IntegerContainer_getLength_fi(self, retval)
implicit none
C in sort.IntegerContainer self
integer*8 self
C out int retval
integer*4 retval
C DO-NOT-DELETE splicer.begin(sort.IntegerContainer.getLength)
integer*8 data
integer*4 lower, upper
integer*4 zero
data zero / 0 /
call sort_IntegerContainer__get_data_f(self, data)
retval = 0
if (data .ne. 0) then
call sort_Integer__array_lower_f(data, zero, lower)
call sort_Integer__array_upper_f(data, zero, upper)
retval = 1 + upper - lower
endif
C DO-NOT-DELETE splicer.end(sort.IntegerContainer.getLength)
end
C
C Return -1 if element i is less than element j, 0 if element i
C is equal to element j, or otherwise 1.
C
subroutine sort_IntegerContainer_compare_fi(self, i, j, comp,
& retval)
implicit none
C in sort.IntegerContainer self
integer*8 self
C in int i
integer*4 i
C in int j
integer*4 j
C in sort.Comparator comp
integer*8 comp
C out int retval
integer*4 retval
C DO-NOT-DELETE splicer.begin(sort.IntegerContainer.compare)
integer*8 i1, i2, data
call sort_IntegerContainer__get_data_f(self, data)
if (data .ne. 0) then
call sort_Integer__array_get1_f(data, i, i1)
call sort_Integer__array_get1_f(data, j, i2)
call sort_Comparator_compare_f(comp, i1, i2, retval)
call sort_Integer_deleteRef_f(i1)
call sort_Integer_deleteRef_f(i2)
endif
C DO-NOT-DELETE splicer.end(sort.IntegerContainer.compare)
end
C
C Swap elements i and j.
C
subroutine sort_IntegerContainer_swap_fi(self, i, j)
implicit none
C in sort.IntegerContainer self
integer*8 self
C in int i
integer*4 i
C in int j
integer*4 j
C DO-NOT-DELETE splicer.begin(sort.IntegerContainer.swap)
integer*8 data, i1, i2
integer*8 tracker
integer*4 len
call sort_IntegerContainer__get_data_f(self, data)
if (data .ne. 0) then
call sort_IntegerContainer_getLength_f(self, len)
if ((i .ge. 0) .and. (j .ge. 0) .and.
$ (i .lt. len) .and. (j .lt. len)) then
call sort_Integer__array_get1_f(data, i, i1)
call sort_Integer__array_get1_f(data, j, i2)
call sort_Integer__array_set1_f(data, i, i2)
call sort_Integer__array_set1_f(data, j, i1)
call sort_Integer_deleteRef_f(i1)
call sort_Integer_deleteRef_f(i2)
else
call synch_RegOut_getInstance_f(tracker)
call synch_RegOut_writeComment_f(tracker,
$ 'sort::IntegerContainer::swap index out of bounds')
call synch_RegOut_forceFailure_f(tracker)
call synch_RegOut_deleteRef_f(tracker)
endif
endif
C Insert the implementation here...
C DO-NOT-DELETE splicer.end(sort.IntegerContainer.swap)
end
C
C Print elements s through e-1
C
subroutine sort_IntegerContainer_output_fi(self, s, e)
implicit none
C in sort.IntegerContainer self
integer*8 self
C in int s
integer*4 s
C in int e
integer*4 e
C DO-NOT-DELETE splicer.begin(sort.IntegerContainer.output)
integer*8 tracker
call synch_RegOut_getInstance_f(tracker)
call synch_RegOut_writeComment_f(tracker,
$ 'output list not implemented')
call synch_RegOut_deleteRef_f(tracker)
C DO-NOT-DELETE splicer.end(sort.IntegerContainer.output)
end
C DO-NOT-DELETE splicer.begin(_miscellaneous_code_end)
C Insert extra code here...
C DO-NOT-DELETE splicer.end(_miscellaneous_code_end)
|
