-
Notifications
You must be signed in to change notification settings - Fork 0
/
check.f90
185 lines (160 loc) · 5.69 KB
/
check.f90
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
program test_dll
implicit none
interface
subroutine test1()
end subroutine test1
subroutine test2()
end subroutine test2
end interface
call test1()
print *
print *
print '("===================== TEST 2 =====================")'
call test2()
end program test_dll
subroutine test1()
use dllnode_mod
implicit none
type(dllnode_t), pointer :: head, head1, deleted, next_in_chain, &
found, head_b, head_c
integer :: i
integer(DATA_KIND), allocatable :: data(:)
integer, allocatable :: starts(:)
integer, parameter :: MAXN = 10
! Working with an empty list
head => null()
print '("Head export = ",*(i0,1x))', dllnode_export(head)
print '("Tail node is = ",L1)', associated(dllnode_tail(head))
print '("Head node is = ",L1)', associated(dllnode_head(head))
print '("3 node is = ",L1)', associated(dllnode_find(head, win(3)))
print '("Is valid an empty node ? ",L1)', dllnode_validate(head)
! Add nodes to the list
do i=1, MAXN
call dllnode_insertinfrontof( &
head, &
dllnode_t(win(i)), &
head1)
head => head1
print '("Head export = ",*(i0,1x))', dllnode_export(head)
print '("Is list valid? ",L1)', dllnode_validate(head)
end do
print '("Sorting...")'
head => dllnode_mergesort(head, cfun_my)
print '("... sorted")'
print '("After sort = ",*(i0,1x))', dllnode_export(head)
print '("Is list valid? ",L1)', dllnode_validate(head)
found=>dllnode_find(head,win(7))
if (associated(found)) then
call dllnode_update(found, win(42))
print '("[7] updated = ",*(i0,1x))', dllnode_export(head)
else
print '("Could not find item to update")'
end if
! Test find, tail, head
print '("Tail node is = ",*(i0,1x))', dllnode_read(dllnode_tail(head))
print '("Head node is = ",*(i0,1x))', dllnode_read(dllnode_head(head))
print '("42 node is = ",*(i0,1x))', &
wout(dllnode_read(dllnode_find(head,win(42))))
print '("Is list valid? Should be F ",L1)', dllnode_validate(dllnode_find(head,win(42)))
! Delete nodes from the list
do i=MAXN,1,-3
call dllnode_remove( &
dllnode_find(head,win(i)),&
deleted,next_in_chain)
if (associated(deleted, head)) head => next_in_chain
if (associated(deleted)) call dllnode_free(deleted)
print '("After removing ",i0," remains = ",*(i0,1x))', i,dllnode_export(head)
end do
found => dllnode_find(head,win(42))
if (associated(found)) found => found%nextnode()
if (associated(found)) print '("After 42 is ",*(i0,1x))', wout(dllnode_read(found))
found => dllnode_find(head,win(9))
if (associated(found)) found => found%prevnode()
print '("Before [9] is ",L1)', associated(found)
! Test import and copy
print *
data = dllnode_export(head, starts)
head_b => dllnode_t(data, starts) ! dllnode_import
print '("HeadB export = ",*(i0,1x))', dllnode_export(head_b)
print *
found => dllnode_find(head, win(5))
!head_c => dllnode_t(found) ! dllnode_copy
head_c => dllnode_t(head) ! dllnode_copy
print '("HeadC export = ",*(i0,1x))', dllnode_export(head_c)
head_c => dllnode_mergesort(head_c, cfun_my)
print '("HeadC sorted = ",*(i0,1x))', dllnode_export(head_c)
print '("Is list valid? ",L1)', dllnode_validate(head)
! Deallocation tests
print *
found => dllnode_find(head, win(6))
call dllnode_freechain(found)
print '("Head after removal = ",*(i0,1x))', dllnode_export(head)
print '("HeadB export = ",*(i0,1x))', dllnode_export(head_b)
print '("HeadC export = ",*(i0,1x))', dllnode_export(head_c)
call dllnode_freechain(head)
print '("Head after removal = ",*(i0,1x))', dllnode_export(head)
call dllnode_freechain(head_b)
print '("HeadB export = ",*(i0,1x))', dllnode_export(head_b)
call dllnode_freechain(head_c)
print '("HeadB export = ",*(i0,1x))', dllnode_export(head_c)
contains
integer function cfun_my(adat, bdat) result(ierr)
integer(DATA_KIND), dimension(:), intent(in) :: adat, bdat
integer :: a, b
a = wout(adat)
b = wout(bdat)
if (a < b) then
ierr = -1
else if (a==b) then
ierr = 0
else
ierr = 1
end if
end function cfun_my
pure function win(a) result(data)
integer(DATA_KIND), allocatable :: data(:)
integer, intent(in) :: a
data = transfer(a,mold)
end function win
pure function wout(data) result(a)
integer(DATA_KIND), intent(in) :: data(size(mold))
integer :: a
a = transfer(data,a)
end function wout
end subroutine test1
subroutine test2()
use dllnode_mod
implicit none
type(dllnode_t), pointer :: head, head1
integer :: i
integer, parameter :: MAXN = 10
integer(DATA_KIND), allocatable :: data(:,:)
! Working with an empty list
head => null()
head => dllnode_reverse(head)
print '("Is valid an empty node ? ",L2)', dllnode_validate(head)
! Add nodes to the list
do i=1, MAXN
call dllnode_insertinfrontof( &
head, &
dllnode_t(int([i,i],DATA_KIND)), &
head1)
head => head1
print '("Head export = ",*(i0,1x))', dllnode_export(head)
print '("Is list valid? ",L2)', dllnode_validate(head)
if (i==1) then
head => dllnode_reverse(head)
print '("Is list valid? ",L2)', dllnode_validate(head)
print '("After reverse = ",*(i0,1x))', dllnode_export(head)
else if (i==2) then
head => dllnode_reverse(head)
print '("Is list valid? ",L2)', dllnode_validate(head)
print '("After reverse = ",*(i0,1x))', dllnode_export(head)
else if (i==MAXN) then
head => dllnode_reverse(head)
print '("Is list valid? ",L2)', dllnode_validate(head)
print '("After reverse = ",*(i0,1x))', dllnode_export(head)
end if
end do
call dllnode_freechain(head)
end subroutine test2