CVS difference for ais/ai-00076.txt

Differences between 1.3 and version 1.4
Log of other versions for file ais/ai-00076.txt

--- ais/ai-00076.txt	1998/10/03 04:28:50	1.3
+++ ais/ai-00076.txt	1999/07/08 17:28:21	1.4
@@ -1,4 +1,4 @@
-!standard 04.02    (11)                               98-06-12  AI95-00076/02
+!standard 04.02    (11)                               99-07-08  AI95-00076/03
 !class confirmation 95-07-27
 !status WG9 approved 98-06-12
 !status ARG Approved  11-0-0  97-11-14
@@ -8,30 +8,30 @@
 !difficulty Easy
 !subject String literal constraint ramification is correct.
 
-!summary 95-07-27
+!summary
 
 The ramification in 4.2(11.a) is correct.
 
-!question 95-07-27
+!question
 
 Is the ramification in 4.2(11.a) correct? (Yes)
 
-!response 95-07-27
+!response
 
 > 4.2 (11) states;
-> 
+>
 >     For the evaluation of a string_literal of type T, a check is made that
 >     the value of each character of the string_literal belongs to the
 >     component subtype of T.  ...  The exception
 >     Constraint_Error is raised if either of these checks fails.
-> 
->     (11.a) RAMIFICATION: The checks on the characters need not involve more 
->     than two checks altogether, since one need only check the characters of 
->     the string with the lowest and highest position numbers against the range 
+>
+>     (11.a) RAMIFICATION: The checks on the characters need not involve more
+>     than two checks altogether, since one need only check the characters of
+>     the string with the lowest and highest position numbers against the range
 >     of the component subtype.
-> 
-> I don't believe the ramification (or I don't understand it) because 
-> 
+>
+> I don't believe the ramification (or I don't understand it) because
+>
 > package t138 is
 >  type Roman_Digit is ('C', 'D', 'I', 'L', 'M', 'V', 'X');
 >  type Roman_Date  is array(positive range <>) of Roman_Digit;
@@ -59,8 +59,12 @@
 need to do at run-time is see whether Some_Digits'Last >= 'V' and
 Some_Digits'First <= 'I'.
 
-!appendix 95-07-27
+!ACATS test
 
+ACATS test C42006A.Ada makes this check.
+
+!appendix
+
 !section 4.2(11)
 !subject String literal constraint ramification seems bogus.
 !reference RM95-4.2(11.a)
@@ -75,12 +79,12 @@
     component subtype of T.  ...  The exception
     Constraint_Error is raised if either of these checks fails.
 
-    (11.a) RAMIFICATION: The checks on the characters need not involve more 
-    than two checks altogether, since one need only check the characters of 
-    the string with the lowest and highest position numbers against the range 
+    (11.a) RAMIFICATION: The checks on the characters need not involve more
+    than two checks altogether, since one need only check the characters of
+    the string with the lowest and highest position numbers against the range
     of the component subtype.
 
-I don't believe the ramification (or I don't understand it) because 
+I don't believe the ramification (or I don't understand it) because
 
 package t138 is
  type Roman_Digit is ('C', 'D', 'I', 'L', 'M', 'V', 'X');
@@ -90,7 +94,7 @@
 
 Michael K. Smith
 Computational Logic Inc. [http://www.cli.com/]
-Austin, TX 
+Austin, TX
 
 Email: mksmith@cli.com
 
@@ -105,19 +109,19 @@
 !discussion
 
 > 4.2 (11) states;
-> 
+>
 >     For the evaluation of a string_literal of type T, a check is made that
 >     the value of each character of the string_literal belongs to the
 >     component subtype of T.  ...  The exception
 >     Constraint_Error is raised if either of these checks fails.
-> 
->     (11.a) RAMIFICATION: The checks on the characters need not involve more 
->     than two checks altogether, since one need only check the characters of 
->     the string with the lowest and highest position numbers against the range 
+>
+>     (11.a) RAMIFICATION: The checks on the characters need not involve more
+>     than two checks altogether, since one need only check the characters of
+>     the string with the lowest and highest position numbers against the range
 >     of the component subtype.
-> 
-> I don't believe the ramification (or I don't understand it) because 
-> 
+>
+> I don't believe the ramification (or I don't understand it) because
+>
 > package t138 is
 >  type Roman_Digit is ('C', 'D', 'I', 'L', 'M', 'V', 'X');
 >  type Roman_Date  is array(positive range <>) of Roman_Digit;
@@ -141,12 +145,12 @@
 of the string are within Some_Digits'Range.  Instead, we take the max and min
 position numbers of characters in the string -- V has the max position
 number (Roman_Digit'Pos('V') = 5), and I has the min position number
-(Roman_Digit'Pos('I') = 2), and all we need to do at run-time is see whether 
+(Roman_Digit'Pos('I') = 2), and all we need to do at run-time is see whether
 Some_Digits'Last >= 'V' and Some_Digits'First <= 'I'.
 
 > Michael K. Smith
 > Computational Logic Inc. [http://www.cli.com/]
-> Austin, TX 
+> Austin, TX
 
 -Tuck
 

Questions? Ask the ACAA Technical Agent