Ada Conformity Assessment Authority      Home Conformity Assessment   Test Suite ARGAda Standard
 
Annotated Ada Reference ManualLegal Information
Contents   Index   References   Search   Previous   Next 

A.18.21 The Generic Package Containers.Bounded_Hashed_Maps

1/3
{AI05-0001-1} The language-defined generic package Containers.Bounded_Hashed_Maps provides a private type Map and a set of operations. It provides the same operations as the package Containers.Hashed_Maps (see A.18.5), 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_Hashed_Maps has the same contents and semantics as Containers.Hashed_Maps except:
3/3
The pragma Preelaborate is replaced with pragma Pure.
4/3
The type Map is declared with discriminants that specify both the capacity (number of elements) and modulus (number of distinct hash values) of the hash table as follows:
5/3
  type Map (Capacity : Count_Type;
            Modulus  : Hash_Type) is tagged private;
6/3
The type Map needs finalization if and only if type Key_Type or type Element_Type needs finalization.
6.a/3
Implementation Note: {AI05-0212-1} The type Map cannot depend on package Ada.Finalization unless the element or key 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. 
7/3
The description of Reserve_Capacity is replaced with: 
8/3
If the specified Capacity is larger than the capacity of Container, then Reserve_Capacity propagates Capacity_Error. Otherwise, the operation has no effect. 
9/3
An additional operation is added immediately following Reserve_Capacity: 
10/3
  function Default_Modulus (Capacity : Count_Type) return Hash_Type;
11/3
Default_Modulus returns an implementation-defined value for the number of distinct hash values to be used for the given capacity (maximum number of elements). 
12/3
The function Copy is replaced with: 
13/3
  function Copy (Source   : Map;
                 Capacity : Count_Type := 0;
                 Modulus  : Hash_Type := 0) return Map;
14/3
{AI05-0264-1} Returns a map with key/element pairs initialized from the values in Source. If Capacity is 0, then the map capacity is the length of Source; if Capacity is equal to or greater than the length of Source, the map capacity is the value of the Capacity parameter; otherwise, the operation propagates Capacity_Error. If the Modulus argument is 0, then the map modulus is the value returned by a call to Default_Modulus with the map capacity as its argument; otherwise, the map modulus is the value of the Modulus parameter. 

Bounded (Run-Time) Errors

15/3
 {AI05-0160-1} {AI05-0265-1} It is a bounded error to assign from a bounded map 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. 
15.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

16/3
 {AI05-0265-1} When a bounded map object M is finalized, if tampering with cursors is prohibited for M other than due to an assignment from another map, then execution is erroneous.
16.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

17/3
 {AI05-0184-1} {AI05-0264-1} For each instance of Containers.Hashed_Maps and each instance of Containers.Bounded_Hashed_Maps, if the two instances meet the following conditions, then the output generated by the Map'Output or Map'Write subprograms of either instance shall be readable by the Map'Input or Map'Read of the other instance, respectively:
18/3
{AI05-0184-1} {AI05-0248-1} the Element_Type parameters of the two instances are statically matching subtypes of the same type; and
19/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); and
20/3
{AI05-0184-1} the preceding two conditions also hold for the Key_Type parameters of the instances. 

Implementation Advice

21/3
 {AI05-0001-1} {AI05-0269-1} Bounded hashed map objects should be implemented without implicit pointers or dynamic allocation. 
21.a.1/3
Implementation Advice: Bounded hashed map objects should be implemented without implicit pointers or dynamic allocation.
22/3
 {AI05-0001-1} The implementation advice for procedure Move to minimize copying does not apply. 
22.a.1/3
Implementation Advice: The implementation advice for procedure Move to minimize copying does not apply to bounded hashed maps.

Extensions to Ada 2005

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

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