1/3

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

2/3

{*AI05-0001-1*}
The declaration of the generic library package
Containers.Bounded_Hashed_Sets has the same contents and semantics as
Containers.Hashed_Sets except:

3/3

4/3

The
type Set 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

Modulus : Hash_Type)

6/3

The type Set needs finalization
if and only if type Element_Type needs finalization.

6.a/3

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

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

14/3

{*AI05-0264-1*}
Returns a set whose elements are 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 value of the Capacity parameter; otherwise,
the operation propagates Capacity_Error. If the Modulus argument is 0,
then the set modulus is the value returned by a call to Default_Modulus
with the set capacity as its argument; otherwise, the set modulus is
the value of the Modulus parameter.

15/3

{*AI05-0160-1*}
{*AI05-0265-1*}
It is a bounded error to use
a bounded set if it was the target of an assignment_statement
whose source was in the middle of an operation that prohibits tampering
with elements [or cursors]. Either Program_Error is raised, or the operation
proceeds as defined.

16/3

{*AI05-0184-1*}
{*AI05-0264-1*}
For each instance of Containers.Hashed_Sets and
each instance of Containers.Bounded_Hashed_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:

17/3

{*AI05-0184-1*}
{*AI05-0248-1*}
the Element_Type parameters of the two instances
are statically matching subtypes of the same type; and

18/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).

19/3

{*AI05-0001-1*}
Bounded set objects should be implemented without
implicit pointers or dynamic allocation.

19.a.1/3

20/3

{*AI05-0001-1*}
The implementation advice for procedure Move to
minimize copying does not apply.

20.a.1/3

20.a/3

{*AI05-0001-1*}
{*AI05-0160-1*}
{*AI05-0184-1*}
The generic package Containers.Bounded_Hashed_Sets
is new.

Ada 2005 and 2012 Editions sponsored in part by **Ada-Europe**