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 | -- Abstract :
--
-- See spec.
--
-- Copyright (C) 2017 - 2019, 2022 Stephen Leake. All Rights Reserved.
--
-- This program is free software; you can redistribute it and/or
-- modify it under terms of the GNU General Public License as
-- published by the Free Software Foundation; either version 3, or (at
-- your option) any later version. This program is distributed in the
-- hope that it will be useful, but WITHOUT ANY WARRANTY; without even
-- the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR
-- PURPOSE. See the GNU General Public License for more details. You
-- should have received a copy of the GNU General Public License
-- distributed with this program; see file COPYING. If not, write to
-- the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
-- MA 02111-1307, USA.
pragma License (GPL);
with AUnit.Assertions;
with AUnit.Checks;
with Ada.Assertions;
with SAL.AUnit;
with SAL.Gen_Unbounded_Definite_Min_Heaps_Fibonacci.Gen_Test;
package body Test_Min_Heaps_Fibonacci is
type Element_Type is record
Data : Float;
Key : Integer;
end record;
function Key (Element : in Element_Type) return Integer is (Element.Key);
procedure Set_Key (Element : in out Element_Type; Key : in Integer)
is begin
Element.Key := Key;
end Set_Key;
package Heaps is new SAL.Gen_Unbounded_Definite_Min_Heaps_Fibonacci
(Element_Type => Element_Type,
Key_Type => Integer,
Key => Key,
Set_Key => Set_Key,
"<" => "<");
procedure Check
(Label : in String;
Computed : in Element_Type;
Expected : in Element_Type)
is
use AUnit.Checks;
begin
Check (Label & ".data", Computed.Data, Expected.Data);
Check (Label & ".key", Computed.Key, Expected.Key);
end Check;
package Heap_Test is new Heaps.Gen_Test;
use Heap_Test;
procedure Check
(Label : in String;
Computed : in Heaps.Heap_Type;
Expected : in Element_Array_Type)
is
use SAL.AUnit;
begin
Check (Label & ".count", Computed.Count, Expected'Length);
declare
I : SAL.Base_Peek_Type := Expected'First;
procedure Check_Node (Element : in Element_Type)
is
use all type SAL.Base_Peek_Type;
begin
Check (Label & SAL.Base_Peek_Type'Image (I), Element, Expected (I));
I := I + 1;
end Check_Node;
begin
Check (Label & ".count", Computed.Count, Expected'Length);
Computed.Process (Check_Node'Unrestricted_Access);
end;
end Check;
-- We don't 'use Unbounded_Definite_Min_Heaps', to test that
-- object.method notation works for heap operations.
----------
-- Test procedures
procedure Nominal (T : in out AUnit.Test_Cases.Test_Case'Class)
is
pragma Unreferenced (T);
use AUnit.Checks;
use SAL.AUnit;
Min_Heap : Heaps.Heap_Type;
begin
Check ("0b", Min_Heap.Count, 0);
-- At each step, we show the expected binary tree. Note that it is
-- not completely ordered; invariant is that each parent is < all of
-- its children.
Min_Heap.Insert ((5.0, 5));
-- 5
Check ("1a", Min_Heap, (1 => (5.0, 5)));
Min_Heap.Insert ((4.0, 4));
-- 4 5
Check ("1b", Min_Heap, ((4.0, 4), (5.0, 5)));
Min_Heap.Insert ((3.0, 3));
-- 3 4 5
Check ("1c", Min_Heap, ((3.0, 3), (4.0, 4), (5.0, 5)));
Min_Heap.Insert ((2.0, 2));
-- 2 3 4 5
Check ("1d", Min_Heap, ((2.0, 2), (3.0, 3), (4.0, 4), (5.0, 5)));
Min_Heap.Insert ((1.0, 1));
-- 1 2 3 4 5
Check ("1e", Min_Heap, ((1.0, 1), (2.0, 2), (3.0, 3), (4.0, 4), (5.0, 5)));
Check ("2", Min_Heap.Get, (1.0, 1)); -- use rename
-- 2
-- 3 4
-- 5
Check ("2a", Min_Heap, ((3.0, 3), (5.0, 5), (4.0, 4), (2.0, 2))); -- depth first order
Check ("2c", Max_Degree (Min_Heap), 2);
Min_Heap.Add ((6.0, 6));
-- 2 6
-- 3 4
-- 5
Check ("3a", Min_Heap, ((3.0, 3), (5.0, 5), (4.0, 4), (2.0, 2), (6.0, 6)));
Check ("4", Min_Heap.Remove, (2.0, 2));
-- 3
-- 6 4
-- 5
Check ("4a", Min_Heap, ((6.0, 6), (5.0, 5), (4.0, 4), (3.0, 3)));
Check ("5", Min_Heap.Remove, (3.0, 3));
-- 4 6
-- 5
Check ("5a", Min_Heap, ((5.0, 5), (4.0, 4), (6.0, 6)));
Check ("6", Min_Heap.Remove, (4.0, 4));
Check ("7", Min_Heap.Remove, (5.0, 5));
Check ("7", Min_Heap.Remove, (6.0, 6));
Check ("8", Min_Heap.Count, 0);
declare
Junk : Element_Type;
begin
Junk := Min_Heap.Remove;
AUnit.Assertions.Assert (False, "9 did not get exception");
exception
when SAL.Container_Empty | Ada.Assertions.Assertion_Error =>
-- Assertion error from precondition if assertions enabled.
null;
end;
for I in reverse 1 .. 3 loop
Min_Heap.Insert ((Float (I), I)); -- use rename
end loop;
Check ("10", Min_Heap, ((1.0, 1), (2.0, 2), (3.0, 3)));
Min_Heap.Clear;
Check ("11", Min_Heap.Count, 0);
Min_Heap.Add ((5.5, 5));
Check ("12", Min_Heap, (1 => (5.5, 5)));
end Nominal;
procedure Test_Adjust (T : in out AUnit.Test_Cases.Test_Case'Class)
is
pragma Unreferenced (T);
A : Heaps.Heap_Type;
B : Heaps.Heap_Type;
begin
for I in 1 .. 5 loop
A.Add ((Float (I), I));
end loop;
B := A;
Check ("1 A", A, ((1.0, 1), (2.0, 2), (3.0, 3), (4.0, 4), (5.0, 5)));
Check ("1 B", B, ((1.0, 1), (2.0, 2), (3.0, 3), (4.0, 4), (5.0, 5)));
A.Clear;
Check ("2 A", A, (1 .. 0 => (1.0, 1)));
Check ("2 B", B, ((1.0, 1), (2.0, 2), (3.0, 3), (4.0, 4), (5.0, 5)));
end Test_Adjust;
----------
-- Public routines
overriding procedure Register_Tests (T : in out Test_Case)
is
use AUnit.Test_Cases.Registration;
begin
Register_Routine (T, Nominal'Access, "Nominal");
Register_Routine (T, Test_Adjust'Access, "Test_Adjust");
end Register_Tests;
overriding function Name (T : Test_Case) return AUnit.Message_String
is
pragma Unreferenced (T);
begin
return new String'("test_min_heaps_fibonacci.adb");
end Name;
end Test_Min_Heaps_Fibonacci;
|