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
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
|
-- C458001.A
--
-- Grant of Unlimited Rights
--
-- The Ada Conformity Assessment Authority (ACAA) holds unlimited
-- rights in the software and documentation contained herein. Unlimited
-- rights are the same as those granted by the U.S. Government for older
-- parts of the Ada Conformity Assessment Test Suite, and are defined
-- in DFAR 252.227-7013(a)(19). By making this public release, the ACAA
-- intends to confer upon all recipients unlimited rights equal to those
-- held by the ACAA. These rights include rights to use, duplicate,
-- release or disclose the released technical data and computer software
-- in whole or in part, in any manner and for any purpose whatsoever, and
-- to have or permit others to do so.
--
-- DISCLAIMER
--
-- ALL MATERIALS OR INFORMATION HEREIN RELEASED, MADE AVAILABLE OR
-- DISCLOSED ARE AS IS. THE ACAA MAKES NO EXPRESS OR IMPLIED
-- WARRANTY AS TO ANY MATTER WHATSOEVER, INCLUDING THE CONDITIONS OF THE
-- SOFTWARE, DOCUMENTATION OR OTHER INFORMATION RELEASED, MADE AVAILABLE
-- OR DISCLOSED, OR THE OWNERSHIP, MERCHANTABILITY, OR FITNESS FOR A
-- PARTICULAR PURPOSE OF SAID MATERIAL.
--
-- Notice
--
-- The ACAA has created and maintains the Ada Conformity Assessment Test
-- Suite for the purpose of conformity assessments conducted in accordance
-- with the International Standard ISO/IEC 18009 - Ada: Conformity
-- assessment of a language processor. This test suite should not be used
-- to make claims of conformance unless used in accordance with
-- ISO/IEC 18009 and any applicable ACAA procedures.
--*
-- OBJECTIVE:
-- Check that the predicate of a quantified expression is evaluated in
-- the order specified by the loop_parameter_specification.
--
-- Check that result of a quantified expression with a
-- loop_parameter_specification is True if the predicate is True for
-- all values if the quantifier is all and any value if the quantifier
-- is some, and is False otherwise.
--
-- Check that evaluation of predicates of a quantified expression with
-- a loop_parameter_specification stops when the result is determined,
-- and no extra evaluations occur.
--
-- HISTORY:
-- BJM 12/28/11 Created original test.
-- RLB 3/24/14 Changed name, additional objectives, and four test cases.
--!
with Report; use Report;
procedure C458001 is
Last_Check : Natural := Natural'First;
Test_Array : array (1 .. 10) of Integer := (others => -1);
function Succession_Check
(X : Integer;
Result : Boolean;
Forward : Boolean)
return Boolean
is
begin
if Forward then
if Natural'Succ (Last_Check) /= X then
Failed ("Expression evaluated out of order");
end if;
else
if Natural'Pred (Last_Check) /= X then
Failed ("Expression evaluated out of order");
end if;
end if;
if Test_Array (X) /= X then
Failed ("Unexptected array value");
end if;
Last_Check := X;
return Result;
end Succession_Check;
begin
Test
("C458001",
"Check that the predicate of a quantified expression " &
"is evaluated in the order specified by the " &
"loop_parameter_specification");
for I in Test_Array'Range loop
Test_Array (I) := I;
end loop;
Last_Check := Test_Array'First - 1;
declare
Expression_Value : Boolean := False;
begin
-- Forward iteration through all elements
Expression_Value :=
(for all I in Test_Array'Range =>
Succession_Check (I, True, True));
if not Expression_Value then
Failed ("Wrong value for quantified expression - 1");
end if;
if Last_Check /= Test_Array'Last then
Failed ("Unexpected value for last evaluated expression - 1");
end if;
exception
when others =>
Failed ("Unexpected exception raised - 1");
end;
Last_Check := Test_Array'Last + 1;
declare
Expression_Value : Boolean := False;
begin
-- Reverse iteration through all elements
Expression_Value :=
(for all I in reverse Test_Array'Range =>
Succession_Check (I, True, False));
if not Expression_Value then
Failed ("Wrong value for quantified expression - 2");
end if;
if Last_Check /= Test_Array'First then
Failed ("Unexpected value for last evaluated expression - 2");
end if;
exception
when others =>
Failed ("Unexpected exception raised - 2");
end;
Last_Check := Test_Array'First - 1;
declare
Expression_Value : Boolean := False;
begin
-- Forward iteration to check one element exists
Expression_Value :=
(for some I in Test_Array'Range =>
Succession_Check (I, (I = Test_Array'Last), True));
if not Expression_Value then
Failed ("Wrong value for quantified expression - 3");
end if;
if Last_Check /= Test_Array'Last then
Failed ("Unexpected value for last evaluated expression - 3");
end if;
exception
when others =>
Failed ("Unexpected exception raised - 3");
end;
Last_Check := Test_Array'Last + 1;
declare
Expression_Value : Boolean := False;
begin
-- Reverse iteration to check if one element exists
Expression_Value :=
(for some I in reverse Test_Array'Range =>
Succession_Check (I, (I = Test_Array'First), False));
if not Expression_Value then
Failed ("Wrong value for Quantified Expression - 4");
end if;
if Last_Check /= Test_Array'First then
Failed ("Unexpected value for last evaluated expression - 4");
end if;
exception
when others =>
Failed ("Unexpected exception raised - 4");
end;
Last_Check := Test_Array'First - 1;
declare
Expression_Value : Boolean := False;
begin
-- Forward iteration stopping on the second element
Expression_Value :=
(for all I in Test_Array'Range =>
Succession_Check (I, Result => I <= 1, Forward => True));
if Expression_Value then
Failed ("Wrong value for quantified expression - 5");
end if;
if Last_Check < 2 then
Failed ("Did not evaluate enough elements for False quantified expression - 5");
elsif Last_Check > 2 then
Failed ("Evaluated too many elements for False quantified expression - 5");
end if;
exception
when others =>
Failed ("Unexpected exception raised - 5");
end;
Last_Check := Test_Array'Last + 1;
declare
Expression_Value : Boolean := False;
begin
-- Reverse iteration stopping on the 7th element.
Expression_Value :=
(for all I in reverse Test_Array'Range =>
Succession_Check (I, Result => I > 7, Forward => False));
if Expression_Value then
Failed ("Wrong value for quantified expression - 6");
end if;
if Last_Check < 7 then
Failed ("Did not evaluate enough elements for False quantified expression - 6");
elsif Last_Check > 7 then
Failed ("Evaluated too many elements for False quantified expression - 6");
end if;
exception
when others =>
Failed ("Unexpected exception raised - 6");
end;
Last_Check := Test_Array'First - 1;
declare
Expression_Value : Boolean := False;
begin
-- Forward iteration to check one element exists, in this case
-- the third element.
Expression_Value :=
(for some I in Test_Array'Range =>
Succession_Check (I, Result => (I = 3), Forward => True));
if not Expression_Value then
Failed ("Wrong value for quantified expression - 7");
end if;
if Last_Check < 3 then
Failed ("Did not evaluate enough elements for True quantified expression - 7");
elsif Last_Check > 3 then
Failed ("Evaluated too many elements for True quantified expression - 7");
end if;
exception
when others =>
Failed ("Unexpected exception raised - 7");
end;
Last_Check := Test_Array'Last + 1;
declare
Expression_Value : Boolean := False;
begin
-- Reverse iteration to check if one element exists, in this case
-- the sixth element.
Expression_Value :=
(for some I in reverse Test_Array'Range =>
Succession_Check (I, Result => (I = 6), Forward => False));
if not Expression_Value then
Failed ("Wrong value for Quantified Expression - 8");
end if;
if Last_Check < 6 then
Failed ("Did not evaluate enough elements for True quantified expression - 8");
elsif Last_Check > 6 then
Failed ("Evaluated too many elements for True quantified expression - 8");
end if;
exception
when others =>
Failed ("Unexpected exception raised - 8");
end;
Last_Check := Test_Array'First - 1;
declare
Expression_Value : Boolean := False;
begin
-- Forward iteration to check one element exists, but none do.
Expression_Value :=
(for some I in Test_Array'Range =>
Succession_Check (I, Result => False, Forward => True));
if Expression_Value then
Failed ("Wrong value for quantified expression - 9");
end if;
if Last_Check /= Test_Array'Last then
Failed ("Unexpected value for last evaluated expression - 9");
end if;
exception
when others =>
Failed ("Unexpected exception raised - 9");
end;
Last_Check := Test_Array'Last + 1;
declare
Expression_Value : Boolean := False;
begin
-- Reverse iteration to check if one element exists, but none do.
Expression_Value :=
(for some I in reverse Test_Array'Range =>
Succession_Check (I, Result => False, Forward => False));
if Expression_Value then
Failed ("Wrong value for Quantified Expression - 10");
end if;
if Last_Check /= Test_Array'First then
Failed ("Unexpected value for last evaluated expression - 10");
end if;
exception
when others =>
Failed ("Unexpected exception raised - 10");
end;
Result;
end C458001;
|