3.6 Array Types
An
array
object is a composite object consisting of components which all have
the same subtype. The name for a component of an array uses one or more
index values belonging to specified discrete types. The value of an array
object is a composite value consisting of the values of the components.
Syntax
Name Resolution Rules
For a
discrete_subtype_definition
that is a
range,
the
range
shall resolve to be of some specific discrete type; which discrete type
shall be determined without using any context other than the bounds of
the
range
itself (plus the preference for
root_integer — see
8.6).
Legality Rules
This paragraph was
deleted.
Static Semantics
An
array is characterized by the number of indices (the
dimensionality
of the array), the type and position of each index, the lower and upper
bounds for each index, and the subtype of the components. The order of
the indices is significant.
A one-dimensional array has a distinct component
for each possible index value. A multidimensional array has a distinct
component for each possible sequence of index values that can be formed
by selecting one value for each index position (in the given order).
The possible values for a given index are all the values between the
lower and upper bounds, inclusive;
this range of
values is called the
index range.
The
bounds
of an array are the bounds of its index ranges.
The
length of a dimension of an array is the number of values of the
index range of the dimension (zero for a null range).
The
length of a one-dimensional array is the length of its only dimension.
An
array_type_definition
defines an array type and its first subtype. For each object of this
array type, the number of indices, the type and position of each index,
and the subtype of the components are as in the type definition; the
values of the lower and upper bounds for each index belong to the corresponding
index subtype of its type, except for null arrays (see
3.6.1).
A
constrained_array_definition
defines an array type with a constrained first subtype. Each
discrete_subtype_definition
defines the corresponding index subtype, as well as the corresponding
index range for the constrained first subtype.
The
constraint of the first subtype consists of the bounds of the
index ranges.
If the type of the
range
resolves to
root_integer, then the
discrete_subtype_definition
defines a subtype of the predefined type Integer with bounds given by
a conversion to Integer of the bounds of the
range;
Dynamic Semantics
43 All components of an array have the
same subtype. In particular, for an array of components that are one-dimensional
arrays, this means that all components have the same bounds and hence
the same length.
Examples
Examples of type
declarations with unconstrained array definitions:
type Vector
is array(Integer
range <>)
of Real;
type Matrix
is array(Integer
range <>, Integer
range <>)
of Real;
type Bit_Vector
is array(Integer
range <>)
of Boolean;
type Roman
is array(Positive
range <>)
of Roman_Digit; --
see 3.5.2
Examples of type
declarations with constrained array definitions:
type Table is array(1 .. 10) of Integer;
type Schedule is array(Day) of Boolean;
type Line is array(1 .. Max_Line_Size) of Character;
Examples of object
declarations with array type definitions:
Grid :
array(1 .. 80, 1 .. 100)
of Boolean;
Mix :
array(Color
range Red .. Green)
of Boolean;
Msg_Table :
constant array(Error_Code)
of access constant String :=
(Too_Big =>
new String'("Result too big"), Too_Small => ...);
Page :
array(Positive
range <>)
of Line := --
an array of arrays
(1 | 50 => Line'(1 | Line'Last => '+',
others => '-'), --
see 4.3.3
2 .. 49 => Line'(1 | Line'Last => '|',
others => ' '));
--
Page is constrained by its initial value to (1..50)