CVS difference for ai05s/ai05-0044-1.txt

--- ai05s/ai05-0044-1.txt	2008/11/27 00:04:12	1.6
+++ ai05s/ai05-0044-1.txt	2009/07/11 03:06:22	1.7
@@ -4,8 +4,8 @@
 !standard A.18.6(56/2)
 !standard A.18.8(66/2)
 !standard A.18.9(79/2)
-!standard A.18.16(5/2)
-!standard A.18.16(9/2)
+!standard A.18.23(5/2)
+!standard A.18.23(9/2)
 !class binding interpretation 07-04-02
 !status Amendment 201Z 08-11-26
 !status WG9 Approved 08-06-20
@@ -203,43 +203,43 @@
 of non-equivalent elements, then the behavior of the container function "="
 is unspecified.
 
-!corrigendum A.18.16(5/2)
+!corrigendum A.18.23(5/2)
 
 @drepl
-The actual function for the generic formal function "<" of Generic_Array_Sort is
+@xindent<The actual function for the generic formal function "<" of Generic_Array_Sort is
 expected to return the same value each time it is called with a particular pair
 of element values. It should define a strict ordering relationship, that is,
 be irreflexive, asymmetric, and transitive; it should not modify Container.
 If the actual for "<" behaves in some other manner, the behavior of the instance
 of Generic_Array_Sort is unspecified. How many times Generic_Array_Sort calls
-"<" is unspecified.
+"<" is unspecified.>
 @dby
-The actual function for the generic formal function "<" of Generic_Array_Sort is
+@xindent<The actual function for the generic formal function "<" of Generic_Array_Sort is
 expected to return the same value each time it is called with a particular pair
 of element values. It should define a strict weak ordering relationship (see A.18);
 it should not modify Container.
 If the actual for "<" behaves in some other manner, the behavior of the instance
 of Generic_Array_Sort is unspecified. How many times Generic_Array_Sort calls
-"<" is unspecified.
+"<" is unspecified.>
 
-!corrigendum A.18.16(9/2)
+!corrigendum A.18.23(9/2)
 
 @drepl
-The actual function for the generic formal function "<" of Generic_Constrained_Array_Sort
+@xindent<The actual function for the generic formal function "<" of Generic_Constrained_Array_Sort
 is expected to return the same value each time it is called with a particular pair
 of element values. It should define a strict ordering relationship, that is,
 be irreflexive, asymmetric, and transitive; it should not modify Container.
 If the actual for "<" behaves in some other manner, the behavior of the instance
 of Generic_Constrained_Array_Sort is unspecified. How many times
-Generic_Constrained_Array_Sort calls "<" is unspecified.
+Generic_Constrained_Array_Sort calls "<" is unspecified.>
 @dby
-The actual function for the generic formal function "<" of Generic_Constrained_Array_Sort
+@xindent<The actual function for the generic formal function "<" of Generic_Constrained_Array_Sort
 is expected to return the same value each time it is called with a particular pair
 of element values. It should define a strict weak ordering relationship (see A.18);
 it should not modify Container.
 If the actual for "<" behaves in some other manner, the behavior of the instance
 of Generic_Constrained_Array_Sort is unspecified. How many times
-Generic_Constrained_Array_Sort calls "<" is unspecified.
+Generic_Constrained_Array_Sort calls "<" is unspecified.>
 
 !ACATS test