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
|
!
! File: sort_MergeSort_Impl.F90
! Symbol: sort.MergeSort-v0.1
! Symbol Type: class
! Babel Version: 0.10.2
! Description: Server-side implementation for sort.MergeSort
!
! WARNING: Automatically generated; only changes within splicers preserved
!
! babel-version = 0.10.2
!
!
! Symbol "sort.MergeSort" (version 0.1)
!
! Merge sort
!
#include "sort_SortingAlgorithm_fAbbrev.h"
#include "sidl_ClassInfo_fAbbrev.h"
#include "sort_Comparator_fAbbrev.h"
#include "sidl_BaseInterface_fAbbrev.h"
#include "sort_Container_fAbbrev.h"
#include "sort_Counter_fAbbrev.h"
#include "sidl_BaseClass_fAbbrev.h"
#include "sort_MergeSort_fAbbrev.h"
! DO-NOT-DELETE splicer.begin(_miscellaneous_code_start)
! This file contains an interative (non-recursive) version of mergesort.
subroutine mergeLists(elems, comp, cmp, swp, start, mid, last)
use sort_Container
use sort_Comparator
use sort_Counter
type(sort_Container_t) :: elems
type(sort_Comparator_t) :: comp
type(sort_Counter_t) :: cmp, swp
integer(selected_int_kind(9)) start, mid, last, j
integer(selected_int_kind(9)) compres, counter
integer(selected_int_kind(9)) m, s
m = mid
s = start
do while ((s .lt. m) .and. (m .lt. last))
call inc(cmp, counter)
call compare(elems, s, m, comp, compres)
if (compres .gt. 0) then
do j = m, s + 1, -1
call inc(swp, counter)
call swap(elems, j, j - 1)
enddo
m = m + 1
endif
s = s + 1
enddo
end subroutine mergeLists
! DO-NOT-DELETE splicer.end(_miscellaneous_code_start)
!
! Class constructor called when the class is created.
!
recursive subroutine sort_MergeSort__ctor_mi(self)
use sort_MergeSort
use sort_MergeSort_impl
! DO-NOT-DELETE splicer.begin(sort.MergeSort._ctor.use)
! Insert use statements here...
! DO-NOT-DELETE splicer.end(sort.MergeSort._ctor.use)
implicit none
type(sort_MergeSort_t) :: self ! in
! DO-NOT-DELETE splicer.begin(sort.MergeSort._ctor)
! DO-NOT-DELETE splicer.end(sort.MergeSort._ctor)
end subroutine sort_MergeSort__ctor_mi
!
! Class destructor called when the class is deleted.
!
recursive subroutine sort_MergeSort__dtor_mi(self)
use sort_MergeSort
use sort_MergeSort_impl
! DO-NOT-DELETE splicer.begin(sort.MergeSort._dtor.use)
! Insert use statements here...
! DO-NOT-DELETE splicer.end(sort.MergeSort._dtor.use)
implicit none
type(sort_MergeSort_t) :: self ! in
! DO-NOT-DELETE splicer.begin(sort.MergeSort._dtor)
! DO-NOT-DELETE splicer.end(sort.MergeSort._dtor)
end subroutine sort_MergeSort__dtor_mi
!
! Static class initializer called exactly once before any user-defined method is dispatched
!
recursive subroutine sort_MergeSort__load_mi()
use sort_MergeSort
use sort_MergeSort_impl
! DO-NOT-DELETE splicer.begin(sort.MergeSort._load.use)
! Insert use statements here...
! DO-NOT-DELETE splicer.end(sort.MergeSort._load.use)
implicit none
! DO-NOT-DELETE splicer.begin(sort.MergeSort._load)
! Insert the implementation here...
! DO-NOT-DELETE splicer.end(sort.MergeSort._load)
end subroutine sort_MergeSort__load_mi
!
! Sort elements using Merge Sort.
!
recursive subroutine sort_MergeSort_sort_mi(self, elems, comp)
use sort_Container
use sort_Comparator
use sort_MergeSort
use sort_MergeSort_impl
! DO-NOT-DELETE splicer.begin(sort.MergeSort.sort.use)
use sort_Counter
! DO-NOT-DELETE splicer.end(sort.MergeSort.sort.use)
implicit none
type(sort_MergeSort_t) :: self ! in
type(sort_Container_t) :: elems ! in
type(sort_Comparator_t) :: comp ! in
! DO-NOT-DELETE splicer.begin(sort.MergeSort.sort)
type(sort_Counter_t) :: cmp, swp
integer(selected_int_kind(9)) stride, i, mid, last, len
mid = 1
stride = 2
call getLength(elems, len)
call getCompareCounter(self, cmp)
call getSwapCounter(self, swp)
do while (mid .lt. len)
do i = 0, len - mid, stride
last = i + stride
if (last .gt. len) then
last = len
endif
call mergeLists(elems, comp, cmp, swp, i, i + mid, last)
enddo
mid = stride
stride = stride + stride
enddo
call deleteRef(cmp)
call deleteRef(swp)
! DO-NOT-DELETE splicer.end(sort.MergeSort.sort)
end subroutine sort_MergeSort_sort_mi
!
! Return merge sort.
!
recursive subroutine sort_MergeSort_getName_mi(self, retval)
use sort_MergeSort
use sort_MergeSort_impl
! DO-NOT-DELETE splicer.begin(sort.MergeSort.getName.use)
! Insert use statements here...
! DO-NOT-DELETE splicer.end(sort.MergeSort.getName.use)
implicit none
type(sort_MergeSort_t) :: self ! in
character (len=*) :: retval ! out
! DO-NOT-DELETE splicer.begin(sort.MergeSort.getName)
retval = 'Merge sort (non-recursive)'
! DO-NOT-DELETE splicer.end(sort.MergeSort.getName)
end subroutine sort_MergeSort_getName_mi
! DO-NOT-DELETE splicer.begin(_miscellaneous_code_end)
! Insert extra code here...
! DO-NOT-DELETE splicer.end(_miscellaneous_code_end)
|
