Ada Conformity Assessment Authority      Home Conformity Assessment   Test Suite ARGAda Standard
 
Annotated Ada Reference Manual (Ada 202x Draft 22)Legal Information
Contents   Index   References   Search   Previous   Next 

A.18.24 The Generic Package Containers.Bounded_Ordered_Sets

1/3
{AI05-0001-1} The language-defined generic package Containers.Bounded_Ordered_Sets provides a private type Set and a set of operations. It provides the same operations as the package Containers.Ordered_Sets (see A.18.9), with the difference that the maximum storage is bounded.

Static Semantics

2/3
{AI05-0001-1} The declaration of the generic library package Containers.Bounded_Ordered_Sets has the same contents and semantics as Containers.Ordered_Sets except:
3/5
{AI12-0112-1} The aspect pragma Preelaborate is replaced with aspect pragma Pure.
3.1/5
{AI12-0112-1} The Global aspect of the package is replaced by:
3.2/5
   Global => Equal_Element'Global & Less_Element'Global &
             Element_Type'Global,
3.a/5
Reason: This package is pure, and thus it cannot have or depend upon any other packages that have state. Thus we require no global uses whatsoever other than those of the formals. 
4/3
The type Set is declared with a discriminant that specifies the capacity (maximum number of elements) as follows: 
5/3
  type Set (Capacity : Count_Type) is tagged private;
6/3
The type Set needs finalization if and only if type Element_Type needs finalization.
6.a/3
Implementation Note: {AI05-0212-1} The type Set cannot depend on package Ada.Finalization unless the element type depends on that package. The objects returned from the Iterator and Reference functions probably do depend on package Ada.Finalization. Restricted environments may need to avoid use of those functions and their associated types. 
6.1/5
{AI12-0339-1} The function Empty is replaced by:
6.2/5
   function Empty (Capacity : Count_Type := implementation-defined)
      return Set
      with Post =>
            Empty'Result.Capacity = Capacity and then
            not Tampering_With_Cursors_Prohibited (Empty'Result) and then
            Length (Empty'Result) = 0;
7/5
{AI12-0112-1} For procedures Insert and Include, the part of the precondition reading: If Insert (or Include) adds an element, a check is made that the capacity is not exceeded, and Capacity_Error is raised if this check fails.
7.1/5
     (if <some length> > Count_Type'Last - <some other length>
      then raise Constraint_Error)
7.2/5
is replaced by:
7.3/5
     (if <some length> > Count_Type'Last - <some other length>
         then raise Constraint_Error
      elsif <some length> > Container.Capacity - <some other length>
         then raise Capacity_Error)
8/5
{AI12-0112-1} In procedure Assign, the precondition is altered to: if Source length is greater than Target capacity, then Capacity_Error is propagated.
8.1/5
   Pre => (if Tampering_With_Cursors_Prohibited (Target)
              then raise Program_Error
           elsif  Length (Source) > Target.Capacity
              then raise Capacity_Error),
9/3
The function Copy is replaced with: 
10/5
{AI12-0112-1}   function Copy (Source   : Set;
                 Capacity : Count_Type := 0) return Map
     with Pre  => (if Capacity /= 0 and then Capacity < Length (Source)
                  then raise Capacity_Error),
          Post => Length (Copy'Result) = Length (Source) and then
                  not Tampering_With_Cursors_Prohibited (Copy'Result) and then
                  Copy'Result.Capacity = (if Capacity = 0 then
                     Length (Source) else Capacity)
;
11/5
{AI12-0112-1} Returns a set with key/element pairs initialized from the values in Source. If Capacity is 0, then the set capacity is the length of Source; if Capacity is equal to or greater than the length of Source, the set capacity is the specified value; otherwise, the operation propagates Capacity_Error.

Bounded (Run-Time) Errors

12/3
{AI05-0160-1} {AI05-0265-1} It is a bounded error to assign from a bounded set object while tampering with elements [or cursors] of that object is prohibited. Either Program_Error is raised by the assignment, execution proceeds with the target object prohibiting tampering with elements [or cursors], or execution proceeds normally. 
12.a/3
Proof: Tampering with elements includes tampering with cursors, so we only really need to talk about tampering with elements here; we mention cursors for clarity. 

Erroneous Execution

13/3
{AI05-0265-1} When a bounded set object S is finalized, if tampering with cursors is prohibited for S other than due to an assignment from another set, then execution is erroneous.
13.a/3
Reason: This is a tampering event, but since the implementation is not allowed to use Ada.Finalization, it is not possible in a pure Ada implementation to detect this error. (There is no Finalize routine that will be called that could make the check.) Since the check probably cannot be made, the bad effects that could occur (such as an iterator going into an infinite loop or accessing a nonexistent element) cannot be prevented and we have to allow anything. We do allow re-assigning an object that only prohibits tampering because it was copied from another object as that cannot cause any negative effects. 

Implementation Requirements

14/3
{AI05-0184-1} {AI05-0264-1} For each instance of Containers.Ordered_Sets and each instance of Containers.Bounded_Ordered_Sets, if the two instances meet the following conditions, then the output generated by the Set'Output or Set'Write subprograms of either instance shall be readable by the Set'Input or Set'Read of the other instance, respectively:
15/3
{AI05-0184-1} {AI05-0248-1} the Element_Type parameters of the two instances are statically matching subtypes of the same type; and
16/3
{AI05-0184-1} the output generated by Element_Type'Output or Element_Type'Write is readable by Element_Type'Input or Element_Type'Read, respectively (where Element_Type denotes the type of the two actual Element_Type parameters).

Implementation Advice

17/3
{AI05-0001-1} {AI05-0269-1} Bounded ordered set objects should be implemented without implicit pointers or dynamic allocation. 
17.a.1/3
Implementation Advice: Bounded ordered set objects should be implemented without implicit pointers or dynamic allocation.
18/3
{AI05-0001-1} The implementation advice for procedure Move to minimize copying does not apply. 
18.a.1/3
Implementation Advice: The implementation advice for procedure Move to minimize copying does not apply to bounded ordered sets.

Extensions to Ada 2005

18.a/3
{AI05-0001-1} {AI05-0160-1} {AI05-0184-1} The generic package Containers.Bounded_Ordered_Sets is new. 

Contents   Index   References   Search   Previous   Next 
Ada-Europe Ada 2005 and 2012 Editions sponsored in part by Ada-Europe